Methods and systems for enhanced data-centric encryption systems using geometric algebra

ABSTRACT

Disclosed are methods and systems to encrypt and decrypt a data message using Geometric Algebra. The encrypt operation performed on a source computing device uses the geometric product (Clifford Product) of a multivector created from plain text/data of the data message with one or more other multivectors that carry encryption keys, the identity of the source and/or other data-centric information. The source computing device sends the encrypted message to a destination computing device. The decrypt operation performed on the destination computing devices recovers the original message multivector, and ultimately the original data message by employing geometric algebra operations such as multivector inverse, Clifford conjugate and others along with the geometric product. Various embodiments may employ a geometric product of the message and encryption/shared secret key, or various embodiments may utilize a geometric product “sandwich” and/or multivector based Sylvester&#39;s equation to increase the confusion and/or diffusion of the encryption system,

CROSS REFERENCE TO RELATED APPLICATIONS

This application is based upon and claims priority to U.S. provisional applications Ser. No. 62/370,183, filed Aug. 2, 2016, entitled “Methods and Systems for Enhanced Data-Centric Encryption Systems Using Geometric Algebra;” Ser. No. 62/452,246, filed Jan. 30, 2017, entitled “Methods and Systems for Enhanced Data-Centric Encryption Additive Homomorphic Systems Using Geometric Algebra;” and Ser. No. 62/483,227, filed Apr. 7, 2017, entitled “Methods and Systems for Enhanced Data-Centric Scalar Multiplicative Homomorphic Encryption Systems Using Geometric Algebra;” all of which are specifically incorporated herein by reference for all that they disclose and teach.

BACKGROUND OF THE INVENTION

In the last several decades, personal computers and other consumer computing devices, such has hand-held devices and smart phones, have become ubiquitous among the general public. As the proliferation of personal computers and other computing devices became prevalent, the usefulness of the computers and other computing devices was increased by interconnected communications between different computers/computing, devices via various electronic networking communications systems. With the advent of the publicly accessible Internet and the establishment of the World Wide Web (WWW) for common communications between computers and/or other computing devices on the Internet, it became common for private identification and financial information to be transferred over the publicly accessible Internet. To ensure that the private information is not accessed by parties that are not intended to be privy to the private information, various encryption techniques have been applied to the private data being transferred over the Internet. As data storage has become accessible over networking technologies, including over the publicly accessible Internet, it has also become prudent to store sensitive data in an encrypted format.

Modern encryption employs mathematical techniques that manipulate positive integers or binary bits. Asymmetric encryption, such as RSA (Rivest-Shamir-Adleman), relies on number theoretic one-way functions that are predictably difficult to factor and can be made more difficult with an ever increasing size of the encryption keys. Symmetric encryption, such as DES (Data Encryption Standard) and AES (Advanced Encryption Standard), uses bit manipulations within registers to shuffle the cryptotext to increase “diffusion” as well as register based operations with a shared key to increase “confusion.” Diffusion and confusion are measures for the increase in statistical entropy on the data payload being transmitted, The concepts of diffusion and confusion in encryption are normally attributed as first being identified by Claude Shannon in the 1940s. Diffusion is generally thought of as complicating the mathematical process of generating unencrypted (plain text) data from the encrypted (cryptotext) data, thus, making it difficult to discover the encryption key of the encryption process by spreading the influence of each piece of the unencrypted (plain) data across several pieces of the encrypted (cryptotext) data. Consequently, an encryption system that has a high degree of diffusion will typically change several characters of the encrypted (cryptotext) data for the change of a single character in the unencrypted (plain) data making it difficult for an attacker to identify changes in the unencrypted (plain) data. Confusion is generally thought of as obscuring. the relationship between the unencrypted (plain) data and the encrypted (cryptotext) data. Accordingly, an encryption system that has a high degree of confusion would entail a process that drastically changes the unencrypted (plain) data into the encrypted (cryptotext) data in a way that, even when an attacker knows the operation of the encryption method (such as the public standards of RSA, DES, and/or AES), it is still difficult to deduce the encryption key.

SUMMARY OF THE INVENTION

An embodiment of the present invention may comprise a method for the encrypted transfer of numeric message data (M) from a source computing device to a destination computing device, the method comprising: distributing by the source computing device the numeric message data (M) into coefficients of a message multivector (M) in accord with a message data coefficient distribution algorithm that is known to both the source computing device and the destination computing device; distributing by the source computing device a shared secret numeric value (S_(S)) into coefficients of a shared secret multivector (S _(S)) in accord with a shared secret coefficient distribution algorithm that is known to both the source computing device and the destination computing device, the shared secret numeric value (S_(S)) being known or knowable to both the source computing device and the destination computing device but is kept secret from other devices not intended to have access to the numeric message data; encrypting by the source computing device a cryptotext multivector (C) as a function of at least one Geometric Algebra geometric product operation on the message multivector (M) and the shared secret multivector (S _(S)); sending by the source computing device the cryptotext multivector (C) to the destination computing device; receiving by the destination computing device the cryptotext multivector (C) sent by the source computing device; distributing by the destination computing device the shared secret numeric value (S_(S)) into the shared secret multivector (S _(S)) in accord with the shared secret coefficient distribution algorithm; decrypting by the destination computing device the cryptotext multivector (C) as a function of at least one Geometric Algebra geometric product operation on the cryptotext multivector (C) and an inverse (S _(S) ⁻¹) of the shared secret multivector (S _(S)) back into the message multivector (M); and converting by the destination computing device the message multivector (M) into the message numeric data (M) in accord with reverse operation of the message data coefficient distribution algorithm.

An embodiment of the present invention may further comprise a method for encrypting numeric message data (M) on a source computing device in order to facilitate transfer of encrypted data from the source computing device to a destination computing device, the method comprising: distributing by the source computing device the numeric message data (M) into coefficients of a message multivector (M) in accord with a message data coefficient distribution algorithm that is known to both the source computing device and the destination computing device; distributing by the source computing device a shared secret numeric value (S_(S)) into coefficients of a shared secret multivector (S _(S)) in accord with a shared secret coefficient distribution algorithm that is known to both the source computing device and the destination computing device, the shared secret numeric value (S_(S)) being known or knowable to both the source computing device and the destination computing device but is kept secret from other devices not intended to have access to the numeric message data; encrypting by the source computing device a cryptotext multivector (C) as a function of at least one Geometric Algebra geometric product operation on the message multivector (M) and the shared secret multivector (S _(S)); and sending by the source computing device the cryptotext multivector (C) to the destination computing device.

An embodiment of the present invention may further comprise a method for decrypting a cryptotext multivector (C) back into numeric message data (M) on a destination computing device in order to facilitate transfer of encrypted data from a source computing device to the destination computing device, the method comprising: receiving by the destination computing device the cryptotext multi vector (C) sent by the source computing device; distributing by the destination computing device the shared secret numeric value (S_(S)) into the shared secret multivector (S _(S)) in accord with the shared secret coefficient distribution algorithm; decrypting by the destination computing device the cryptotext multivector (C) as a function of at least one Geometric Algebra geometric product operation on the cryptotext multivector (C) and an inverse (S _(S) ⁻¹) of the shared secret multivector (S _(S)) back into the message multivector (M); and converting by the destination computing device the message multivector (M) into the message numeric data (M) in accord with reverse operation of the message data coefficient distribution algorithm.

An embodiment of the present invention may further comprise a Enhanced Data-Centric Encryption (EDCE) system for the encrypted transfer of numeric message data (M), the EDCE system comprising: a source computing device, wherein the source computing device further comprises: a source numeric message distribution subsystem that distributes the numeric message data (M) into coefficients of a message multivector (M) in accord with a message data coefficient distribution algorithm that is known to both the source computing device and the destination computing device; a source numeric shared secret distribution subsystem that distributes a shared secret numeric value (S_(S)) into coefficients of a shared secret multivector (S _(S)) in accord with a shared secret coefficient distribution algorithm that is known to both the source computing device and the destination computing device, the shared secret numeric value (S_(S)) being known or knowable to both the source computing device and the destination computing device but is kept secret from other devices not intended to have access to the numeric message data; a source encryption subsystem that encrypts a cryptotext multivector (C) as a function of at least one Geometric Algebra geometric product operation on the message multivector (M) and the shared secret multivector (S _(S)); a source send subsystem that sends the cryptotext multivector (C) to the destination computing device; and a destination computing device, wherein the destination computing device further comprises: a destination receive subsystem that receives the cryptotext multivector (C) sent by the source computing device; a destination numeric shared secret distribution subsystem that distributes the shared secret numeric value (S_(S)) into the shared secret multivector (S _(S)) in accord with the shared secret coefficient distribution algorithm; a destination decrypt subsystem that decrypts the cryptotext multivector (C) as a function of at least one Geometric Algebra geometric product operation on the cryptotext multivector (C) and an inverse (S _(S) ⁻¹) of the shared secret multivector (S _(S)) back into the message multivector (M); and a destination convert multivector subsystem that converts the message multivector (M) into the message numeric data (M) in accord with reverse operation of the message data coefficient distribution algorithm.

An embodiment of the present invention may further comprise a Enhanced Data-Centric Encryption (EDGE) source computing device for encrypting numeric message data (M) in order to facilitate transfer of encrypted data from the EDCE source computing device to a destination computing device, the EDCE source computing device comprising: a source numeric message distribution subsystem that distributes the numeric message data (M) into coefficients of a message multivector (M) in accord with a message data coefficient distribution algorithm that is known to both the EDCE source computing device and the destination computing device; a source numeric shared secret distribution subsystem that distributes a shared secret numeric value (S_(S)) into coefficients of a shared secret multivector (S _(S)) in accord with a shared secret coefficient distribution algorithm that is known to both the EDCE source computing device and the destination computing device, the shared secret numeric value (S_(S)) being known or knowable to both the EDGE source computing device and the destination computing device but is kept secret from other devices not intended to have access to the numeric message data; a source encryption subsystem that encrypts a cryptotext multivector (C) as a function of at least one Geometric Algebra geometric product operation on the message multivector (M) and die shared secret multivector (S _(S)); and a source send subsystem that sends the cryptotext multivector (C) to the destination computing device.

An embodiment of the present invention may further comprise a Enhanced Data-Centric Encryption (EDCE) destination computing device for decrypting a cryptotext multivector (C) back into numeric message data (M) in order to facilitate transfer of encrypted data from a source computing device to the EDCE destination computing device, the EDCE destination computing device comprising: a destination receive subsystem that receives the cryptotext multivector (C) sent by the source computing device; a destination numeric shared secret distribution subsystem that distributes the shared secret numeric value (S_(S)) into the shared secret multivector (S _(S)) in accord with the shared secret coefficient distribution algorithm; a destination decrypt subsystem that decrypts the cryptotext multivector (C) as a function of at least one Geometric Algebra geometric product operation on the cryptotext multivector (C) and an inverse (S _(S) ⁻) of the shared secret multivector (S _(S)) back into the message multivector (M); and a destination convert multivector subsystem that converts the message multivector (M) into the message numeric data (M) in accord with reverse operation of the message data coefficient distribution algorithm.

BRIEF DESCRIPTION OF THE DRAWINGS

In the drawings,

FIG. 1 is a block diagram of the hardware implementation for an embodiment.

FIG. 2 is a flow chart of the general operation for an embodiment.

FIG. 3A is a flow chart of the source computing device symmetric key operation for an embodiment.

FIG. 3B is a flow chart of the destination computing device symmetric key operation for an embodiment.

FIG. 4A is a flow chart of the source computing device symmetric key and cryptotext masking operation for an embodiment.

FIG. 4B is a flow chart of the destination computing device symmetric key and cryptotext masking operation for an embodiment.

FIG. 5 is a flow chart of an embodiment for the Enhanced Data-Centric Encryption (EDGE) encryption/decryption by using a geometric product “sandwich.”

FIG. 6 is a flow chart of an embodiment for the EDCE encryption/decryption by using Sylvester's equation and/or for EKE secure message sequence indexing.

FIG. 7 is a block diagram illustrating generating/extracting/obtaining a second shared secret key from the original shared secret multivector for an embodiment.

Detailed Description of the Embodiments

An embodiment may advantageously utilize Geometric Algebra to provide the encryption and decryption of numeric messages that are to be transmitted through, and possibly have stored by, an intermediary computing system (e.g., the broad-lased computing system currently, and commonly, referred to as the Cloud, or cloud computing). An embodiment of the Geometric Algebra encryption/decryption system that performs the encryption/decryption functions of transferring data securely using Geometric Algebra based encryption/decryption from a source/sender system to a destination/receiver system may be referred to as an Enhanced Data-Centric Encryption (EDGE) system.

Geometric Algebra is an area of mathematics that describes the geometric interaction of vectors and other objects in a context intended to mathematically represent physical interactions of objects in the physical world. The use of Geometric Algebra for cryptography represents a new, manmade use of Geometric Algebra for a purpose entirely outside of the natural basis of Geometric Algebra for representing physical interactions of objects in the real, physical, word. As used herein, this area of mathematics encompasses Geometric Algebra, Conformal Geometric Algebra and Clifford Algebra (referred to collectively herein as “Geometric Algebra”). Generally, Geometric Algebra defines the operations, such as geometric product, inverses and identities, which facilitate many features of embodiments of the example EDGE system embodiments disclosed herein. Further, Geometric Algebra allows for the organization and representation of data into the “payload” of a multivector where the data in the payload may represent, for example, plaintext, cryptotext, or identifying signatures. Consequently, embodiments of the EIKE system make beneficial use of Geometric Algebra properties to provide encryption and decryption operations in a relatively computationally simplistic manner while still providing robust security for both data in motion and data at rest (e.g., data stored in the Cloud).

When encrypted data is transferred through an intermediary computing system, such as is done with cloud based computing, the encrypted data values may be stored on the intermediary computing system until such time a user wants or is attached to the network to allow delivery of the encrypted data value from the source computing device via the intermediary computing system. Alternatively, the encrypted data values may be immediately forwarded to a destination computing device by the intermediary computing system as soon as the subject encrypted data values are received by the intermediary computing system. However, as one skilled in the art will recognize, the process of receiving the encrypted data values at the intermediary computing system inherently includes storing the encrypted data values at the intermediary computing system even if only fleetingly in an immediately used and erased Random Access Memory (RAM) location or operational register location of a computational subsystem of the intermediary computing system.

Embodiments of EDGE system embodiments may be comprised of functional blocks, each of which may be tailored as described in more detail below according to objectives for scope, capability and security, The following sections provide a mathematical and numerical description of these functional blocks.

In order to help minimize the potential confusion of the complex subject matter herein, the descriptions below have been split up to separately cover foundational various topics regarding embodiments of an EDGE system. In view of that, Section 1 provides a general description of embodiments of the foundational operations of an EDGE system. Section 2 provides additional descriptions of embodiments of the foundational EDGE system, including the packing of information into multivectors the encryption and decryption of such multivectors and the unpacking to recover the original information. Appendix A provides a Geometric Algebra. Overview. Generally, in this description, as is the typical convention, for particular examples of operations, Alice and Bob are used for the sending/source and receiving/destination entities, respectively. Thus, the arrangement of the disclosure may be summarized as follows:

Section 1: General EDGE Message Encryption/Decryption

-   -   A. Hardware Implementation for EDGE Embodiments (FIG. 1)     -   B. General EDGE Operational Flow Charts (FIGS. 2-4)

Section 2: Additional Descriptions of EDGE Message Encryption/Decryption

-   -   A. Packing and unpacking multivectors         -   1) Text to number         -   2) Number to text         -   3) Multivector Data Structure         -   4) Number to multivector         -   5) Multivector to number     -   B. Shared Secret     -   C. Cryptotext creation     -   D. Decryption     -   E. EDCE Flow Chart (FIGS. 5-6)     -   F. Symmetric Key Pair Encryption/Decryption from 0-Blade         Reduction Operation (FIG. 7)         -   0-Blade Reduction Operation         -   Geometric Algebra Encryption Primitives         -   Numerical Examples for encryption and decryption with double             shared secret in 3 dimensions     -   G. An Unbreakable Primitive Using Geometric Algebra and         Arithmetic Functions         -   Example with secret sharing and 3D multivectors

Appendix A: Geometric Algebra Overview

Section 1: General EDCE Message Encryption/Decryption

With the arrival of the interact and many forms of mobile devices, the volume of encrypted data is growing exponentially. Portable devices like “thumb drives,” “smart cards” and Solid State Disks (SSDs) contain both plain text and or encrypted “passive” data storage. Passive data storage is found on the tiny devices for the Internet of Things (IoT) as well as the large memories in server farms.

When data leaves storage, when it is in motion, it is even more vulnerable to attack. Current encryption techniques have not evolved alongside network security infrastructure and they are not well suited for the sheer volume of data in motion. As we move towards “cloud computing,” as mobile devices move us towards “perimeter-less” network security, the industry is moving away from trusting just the security of networks, servers or applications and focusing toward data-centric encryption. With data-centric encryption and authentication there are controls that are traveling with the data rather than just happening at the application layer or the final destination in a network.

However, the fluidity of this data in motion stalls with the computationally intensive mathematics that remain at the heart of current encryption infrastructures. Ciphers such as RSA (Rivest-Shamir-Adieman), DES (Data Encryption Standard) and/or AES (Advanced Encryption Standard) are little more than static “machinery” that bogs down communication efficiency. The actual problem is much bigger. How can robust security be provided when:

-   -   a) End-point computational resources are limited (e.g., the         Internet of Things IoT).     -   b) Encryption/decryption must be near-real time     -   c) Authentication of the source and destination must be         continuously reasserted

An embodiment may be described as enhanced data-centric encryption, or EDGE. Compared to incumbent encryption schemes, EDGE is computationally simplistic while providing robust security over the span of the communication channel. EDGE security is scalable from tiny embedded IoT (Internet of Things) devices up to server farms. EDGE functionality enables many cipher schemes that show speed and bandwidth advantages over current methods. One aspect of EDGE that provides speed enhancement in the encryption/decryption of data is that the EDGE encryption/decryption may be implemented using basic arithmetic operations of addition, subtraction, multiplication, and division. Notably, EDGE does not require a complex operation to select a large prime number, to calculate a logarithm function, to calculate a natural logarithm function, and/or to calculate other complex and computationally intensive mathematical functions (i.e., prime numbers, logarithms, natural logarithms, and/or other complex mathematical Operations are not required in the Geometric Algebra calculations disclosed herein).

A central feature of the various embodiments is the use of Geometric Algebra, an area of mathematics that has not been utilized before in encryption. Geometric Algebra as used herein is an area of mathematics that encompasses Geometric Algebra, Conformal Geometric Algebra and Clifford Algebra (collectively herein, “Geometric Algebra”). Geometric Algebra allows for the organization and representation of data into the “payload” of a multivector where the data may be plaintext, cryptotext, or signatures, for example. Geometric Algebra defines the operations, such as geometric product, inverses and identities, which are the enablers of encryption/decryption calculations of various embodiments.

Multivectors are simply the additive combination of a scalar, a vector, a bi-vector and so forth up to an n-dimension vector. However, the unit vectors follow the algebraic structure of quaternions (Hamilton) and non-commutative algebra (Grassman). These two types of algebra allowed Clifford to conceive of the Geometric Product which is used by the various embodiments as one of the “primitive” functions of the embodiments of EDCE systems.

An example of a two-dimension (2D) multivector A that includes a scalar and a vector is:

Ā=a ₀ +a ₁ ē ₁ +a ₂ ē ₂ +a ₁₂ ē ₁₂

where ē_(i) is a unit vector along the i-axis and ē₁₂ represents the orientation of the area created by a₁₂. The operations of Geometric Algebra on multivectors are discussed more fully in “Appendix A” herein, below, but some general observations may be helpful to the description of the various embodiments disclosed below. First, each of the a_(i) values in the multivector Ā above may be “packed” with information and each a_(i) value may range from zero to very large (e.g., >256,000 bits or an entire message). Secondly, the inverse of Ā when multiplied by Ā yields unity, or:

ĀĀ ⁻¹=1

Thus, if a second multivector B is created and the geometric product ĀB is transmitted then the destination can recover B through:

ĀĀ ⁻¹ B=B

For the various embodiments, the “payload” may be packed in the values of the scalars and coefficients of the multivector elements, To ensure that EDCE systems may perform properly, it is necessary to have some limitations on the coefficient values chosen for the multivectors. For instance, the Rationalize operation on multivectors yields zero when all multivector coefficients are equal. Such multivectors having all equal coefficients have no inverse and the geometric product of such multivectors having all equal coefficients with another multivector has no inverse. As discussed in more detail below, the decryption methodology for EDCE systems utilize the inverse of the cryptotext multivector being decrypted and of the security keys) multivector to perform the decryption. Therefore, the cryptotext multivector being decrypted should not have all equal value coefficients. One means to ensure that the cryptotext multivector being decrypted does not have all equal value coefficients is to have the packing/coefficient distribution method ensure that not all coefficients are equal to each other (i.e., at least one coefficient should be different than the other coefficients) when creating the shared security multivector(s) and the data message multivectors, For an embodiment of the EDCE that simply transfers the data message, ensuring that that not all coefficients are equal to each other when creating the shared security multivector(s) and the data message multivectors will ensure that the cryptotext multivector to be decrypted will not have all equivalent coefficients.

Additionally, separate multivectors may be encoded for many purposes, such as a shared secret (defined below), authentication information, and timestamps. In addition to the encryption and decryption of a message, the EDCE multivector format and Geometric Algebra foundation of an EDGE embodiment may enable a single transmission to contain far more than just cryptotext, including dummy data to increase encryption security, command instructions for additional operations, and/or configuration data for the additional operations.

A. Hardware Implementation for EDCE Embodiments (FIG. 1)

FIG. 1 is a block diagram 100 of the hardware implementation for an embodiment. A first computing device 102 is connected over an electronic network/bus connection 104 to a second computing device 106. in the embodiment shown in fig, 1, the first computing device 102 acts as the source device 102 that sends the encrypted message 108 over the network/bus connection 104. The second computing device 106 acts as the destination device 106 that receives the encrypted message 108 from the network/bus connection 104. Generally, communications, including encrypted communications, are bi-directional such that the first 102 and second 106 computing devices may change roles as the source device 102 and destination device 106 as is necessary to accommodate the transfer of data back and forth between the first 102 and second 106 computing devices.

Further, as shown in FIG. 1, the first computing device 102 appears to be a laptop computer and the second computing device 106 appears to be a tablet device. Generally, any computing device capable of communication over any form of electronic network or bus communication platform may be one, or both of the first 102 and second 106 computing devices. Further, the first 102 and second computing devices 106 may actually be the same physical computing device communicating over an internal bus connection 104 with itself, but still desiring encrypted communication to ensure that an attacker cannot monitor the internal communications bus 104 to obtain sensitive data communications in an unencrypted format.

Various embodiments may implement the network/bus communications channel 104 using any communications channel 104 capable of transferring electronic data between the first 102 and second 106 computing devices. For instance, the network/bus communication connection 104 may he an Internet connection routed over one or more different communications channels during transmission from the first 102 to the second 106 computing devices. Likewise, the network bus communication connection 104 may be an internal communications bus of a computing device, or even the internal bus of a processing or memory storage Integrated Circuit (EC) chip, such as a memory chip or a Central Processing Unit (CPU) chip. The network/bus communication channel 104 may utilize any medium capable of transmitting electronic data communications, including, but not limited to: wired communications, wireless electro-magnetic communications, fiber-optic cable communications, light/laser communications, sonic/sound communications, etc., and any combination thereof of the various communication channels.

The various embodiments may provide the control and management functions detailed herein via an application operating on the first 102 and/or second 106 computing devices. The first 102 and/or second 106 computing devices may each be a computer or computer system, or any other electronic devices device capable of performing the communications and computations of an embodiment. The first 102 and second 104 computing devices may include, but are not limited to: a general purpose computer, a laptop/portable computer, a tablet device, a smart phone, an industrial control computer, a data storage system controller, a CPU, a Graphical Processing Unit (GPU), an Application Specific Integrated Circuit (ASI), and/or a Field Programmable Gate Array (FPGA). Notably, the first 102 and second 106 computing devices may be the storage controller of a data storage media (e.g., the controller for a hard disk drive) such that data delivered to/from the data storage media is always encrypted so as to limit the ability of an attacker to ever have access to unencrypted data. Embodiments may be provided as a computer program product which may include a computer-readable, or machine-readable, medium having stored thereon instructions which may be used to program/operate a computer (or other electronic devices) or computer system to perform a process or processes in accordance with the various embodiments. The computer-readable medium may include, but is not limited to, hard disk drives, floppy diskettes, optical disks, Compact Disc Read-Only Memories (CD-ROMs), Digital Versatile Disc ROMS (DVD-ROMs), Universal Serial Bus (USB) memory sticks, magneto-optical disks, ROMs, random access memories (RAMS), Erasable Programmable ROMs (EPROMs), Electrically Erasable Programmable ROMs (EEPROMs), magnetic optical cards, flash memory, or other types of media/machine-readable medium suitable for storing electronic instructions. The computer program instructions may reside and operate on a single computer/electronic device or various portions may be spread over multiple computers/devices that comprise a computer system. Moreover, embodiments may also be downloaded as a computer program product, wherein the program may be transferred from a remote computer to a requesting computer by way of data signals embodied in a carrier wave or other propagation medium via a communication link (e.g., a modem or network connection, including both wired/cabled and wireless connections).

B. General EDGE Operational Flow Charts (FIGS. 2-4)

FIG. 2 is a flow chart 200 of the general operation for an embodiment. At process 206 a shared secret numeric data value (S_(S)) is shared between the source 202 and destination 204. The various embodiments may share the shared secret numeric data value (S_(S)) between the source 202 and destination 204 via any means desired by the users. To ensure the shared secret numeric data value (S_(S)) is kept secret, it is likely that some type of handshaking/setup encrypted key transfer mechanism will be desired to share the shared secret numeric data value (S_(S)). For example, the shared secret numeric data value (S_(S)) may be shared between the source 202 and destination 204 by means including, but not limited to: pre-conditioning the source 202 computing device and the destination 204 computing device with the shared secret numeric value (S_(S)), a standard public/private key exchange technique, RSA (Rivest-Shamir-Adlernan) key exchange, and/or Diffie-Hellman key exchange (disclosed in more detail herein, below), Further, the original shared secret may be an alphanumeric string in ASCII (American Standard Code for Information Exchange) or another encoding protocol that is converted to a numeric value based on the associated encoding protocol, such as: ASCII, other English language/alphabetic coding systems, foreign language encoding for non-alphabetic languages (e.g., katakana for Japanese), or even pure symbol to numeric values such as for emoji's. However, both the source 202 and destination 204 need to know and use the same alphanumeric text conversion into a numeric value process to ensure that results of both the source 202 and the destination 204 are the same.

At process 208, the source 202 converts any alphanumeric text in the message into numeric message data (M) based on the alphanumeric encoding protocol (e.g., ASCII, other English language/alphabetic coding systems, foreign language encoding for non-alphabetic languages (e.g., katakana for Japanese), or even pure symbol to numeric values such as for emojii's) of the original text. Again, both the source 202 and destination 204 need to know and use the same alphanumeric text conversion into a numeric value process to ensure that results of both the source 202 and the destination 204 are the same. If the message data is already in numeric form, it is not necessary to perform process 208 as the original numeric message data (M) may be used as is. The various embodiments may perform the encryption process with numeric Message data (M) that is, but are not limited to: positive numbers, negative numbers, zero, integer numbers, and/or real numbers. At process 210, the source 202 distributes the numeric message data (M) into message multivector (M) coefficients. The encryption system will work with just one non-zero message multivector (M) coefficient, but, the more non-zero message multivector (M) coefficients there are, the stronger the encryption will become, so it is desirable to have more than one non-zero message multivector (M) coefficient. At process 212, the source 202 distributes shared secret numeric value (S_(S)) into shared secret multivector (S _(S)) coefficients. Again, the encryption system will work with just one non-zero shared secret multivector (S _(S)) coefficient, but, the more non-zero shared secret multivector (S _(S)) coefficients there are, the stronger the encryption will become, so, again, it is desirable to have more than one non-zero shared secret multivector (S _(S)) coefficient. One skilled in the art will recognize that there are many approaches for distributing numeric data into several coefficients of a multivector (see herein, below for disclosure of some example packing/distribution methods). The primary requirement for the distribution process from the numeric values of the message (M) and the shared secret (S_(S)) to the multivector coefficient values (M and S _(S)) is that the source 202 and the destination 204 both know the processes 210/222 and 212/224 such that the destination 204 can reconstruct the original message (M). As long as it is known to both the source 202 and the destination 204, the distribution of numeric data to multivector coefficients may be performed differently between the message (M) and the shared secret (S_(S)). Further, the various embodiments may perform the encryption process with multi-vector coefficient values for both the message (M) and shared and (S _(S)) that are, but are not limited to: positive numbers, negative numbers, zero, integer numbers, and/or real numbers.

Again, for the various embodiments, the “payload” may be packed in the values of the scalars and coefficients of the multivector elements. To ensure that EDGE systems may perform properly, it is necessary to have some limitations on the coefficient values chosen for the multivectors. For instance, the Rationalize operation on multivectors yields zero when all multivector coefficients are equal. Such multivectors having all equal coefficients have no inverse and the geometric product of such multivectors having all equal coefficients with another multivector has no inverse. As discussed in more detail below, the decryption methodology for EDCE systems utilize the inverse of the cryptotext multivector being decrypted and of the security key(s) multivector to perform the decryption. Therefore, the cryptotext multivector being decrypted should not have all equal value coefficients. One means to ensure that the cryptotext multivector being decrypted does not have all equal value coefficients is to have the packing/coefficient distribution method ensure that not all coefficients are equal to each other (i.e., at least one coefficient should be different than the other coefficients) when creating the shared security multivector(s) and the data message multivectors. For an embodiment of the EDGE that simply transfers the data message, ensuring that that not all coefficients are equal to each other when creating the shared security multivector(s) and the data message multivectors will ensure that the cryptotext multivector to be decrypted will not have all equivalent coefficients.

It is not necessary that the distribution (i.e., “packing”) of the message multivector (M) coefficients and the distribution (i.e., “packing”) of the shared secret multivector (S _(S)) use the same methodology to perform the “packing” process. Consequently, the distribution (i.e., “packing”) of the shared secret multivector (S _(S)) may be performed in any fashion independent of the distribution (i.e., “packing”) of the message multivector (M) coefficients so long as the distribution (i.e., “packing”) method of the shared secret multivector (S _(S)) is known and used consistently by the source 202 and destination 204 computing devices as, ultimately, the shared secret multivector (S _(S)) used by the source 202 and destination 204 should be equal to each other to ensure that the decryption operations 226 work properly in relation to the encryption 214 operations. Likewise, the distribution (i.e., “packing”) of the message multivector (M) may be performed in any fashion independent of the distribution (i.e., “packing”) of the shared secret multivector (S _(S)) coefficients so long, as the distribution (i.e., “packing”) method of the message multivector (M) is known and used consistently by the source 202 and destination 204 computing devices as, ultimately, again, using the same “packing” methodology by the source 202 and destination 204 for the message multivector (M) will ensure that the decryption operations 226 work properly in relation to the encryption 214 operations when converting the message multivector (M) back to text.

It is noteworthy that the number of potential coefficients is directly related to the size/dimension (N) of the multivectors such that the number of coefficients increases by a factor of 2 (i.e., 2^(N)) for each incremental increase in the size/dimension (N) of the multivector. To increase the confusion and/or diffusion of the encryption process disclosed herein, using multivectors of at least two dimensions will provide at least four coefficients to distribute the numeric data of the message (M) and the shared secret (S_(S)). By increasing the number of dimensions (N) of multivectors beyond two-dimension multivectors, the confusion and/or diffusion security characteristics will also be increased due to the additionally available multivector coefficients. Further, with the additionally available coefficients it is also possible to transfer more data in a single multivector message (M) payload using the additionally available multivector coefficients. Also, the additionally available multivector coefficients may permit including additional feature data in addition to the message data (M) in the additional multivector coefficients, such as, but not limited to: dummy data to increase encryption security, command instructions for additional operations, and configuration data for the additional operations.

At process 214, the source 202 encrypts a cryptotext multivector (C) as a function of at least one Geometric Algebra geometric product operation on the message multivector (M) and the shared secret multivector (S _(S)). At process 216, the source 202 converts the cryptotext multivector (C) into cryptotext numeric data (C) in accord with reverse operation of a cryptotext data coefficient distribution algorithm that is known to both the source 202 and the destination 204. While not typical of most encryption systems, an embodiment may also omit process 216 and directly send a representation of the cryptotext multivector (C) without first converting the cryptotext multivector (C) into cryptotext numeric data (C). The transmission may be implemented as a series of transfers of the coefficients or as some form of records/packets that define a data structure that carries the coefficient data of the cryptotext multivector (C). Typically, the various embodiments will include process 216 to convert the cryptotext multivector (C) into cryptotext numeric data (C) in order to maintain compatibility with legacy and/or third party systems as well as to obtain the additional confusion and diffusion characteristics of encapsulating the cryptotext multivector (C) coefficients into a single cryptotext numeric data (C) value. If process 216 is used to convert the cryptotext multivector (C) into cryptotext numeric data (C), it is necessary for any computing device/system that wishes to operate on the cryptotext multivector (C) to have knowledge of the particular conversion methodology so that computing device/system may properly recreate the cryptotext multivector (C).

Due to the nature of the geometric product operation of Geometric Algebra, there are many possible variations of the geometric product application that will provide similar degrees of confusion and diffusion. Some, but not all, of the potential geometric product calculations to encrypt the message data (M) include: a geometric product (C=M S _(S)) of the message multivector (M) and the shared secret multivector (S _(S)); geometric product “sandwich” (C=S _(S) M S _(S)); and multivector based Sylvester's equation (C=S _(S) M+M S _(S). At process 218, the source 202 sends the cryptotext numeric data (C) to the destination 204.

At process 220, the destination 204 receives the cryptotext numeric data (C) sent by the source 202. At process 222., the destination distributes the cryptotext numeric data (C) into the cryptotext multivector (C) using the cryptotext data coefficient distribution algorithm that is known to both the source 202 and the destination 204. For the less typical embodiment, if process 216 to convert the cryptotext multivector (C) into cryptotext numeric data (C) is omitted, then process 222 is also omitted as the cryptotext multivector (C) was transmitted directly so there is not a need to convert the cryptotext numeric data (C) back into the cryptotext multivector (C). At process 224, the destination 204 distributes shared secret numeric value (S_(S)) into shared secret multivector (S _(S)) coefficients in the same fashion as was done for the source 202 at process 212. At process 226, the destination decrypts the cryptotext multivector (C) as a function of at least one Geometric Algebra geometric product operation on the cryptotext multivector (C) and an inverse (S _(S) ⁻¹) of the shared secret multivector (S _(S)) back into the message multivector (M). Again, due to the nature of the geometric product operation of Geometric Algebra there are many possible variations of the geometric product application that will provide similar degrees of confusion and diffusion. Some, but not all, of the potential geometric product calculations to decrypt the message data (M) include: a geometric product (M=C S _(S) ⁻¹) of said cryptotext multivector (C) and said inverse (S _(S) ⁻¹) of said shared secret multivector (S _(S)); geometric product “sandwich” (M=S _(S) ⁻¹ C S _(S) ⁻¹); and multivector based Sylvester's equation (M=(S _(S)+S _(S)+S _(S) ⁻¹ S _(S) S _(S)+S _(S))⁻¹ C S _(S) ⁻¹(S _(S) ⁻¹ C S _(S)+C) to decrypt). At process 228, the destination 204 converts the message multivector (M) into the message numeric data (M) in accord with reverse operation of the message data coefficient distribution algorithm of the source 202 at process 210. At process 230, if necessary, the destination 202 converts the numeric message data (M) back into the original alphanumeric text message as a reverse function of the process of the source 202 at step 208 that converted that alphanumeric text to the numeric message data (M) using standard computer character encoding characteristics.

FIG. 3A is a flow chart 300 of the source computing device symmetric key operation for an embodiment. The encryption process 214 of the source 202 of FIG. 2 may further include processes 302-306 to use symmetric shared secret security keys to further enhance the security of an embodiment. For instance, at process 302, the source computing device may generate/extract/obtain a second shared secret key (S_(S) ₂ ) from the original shared secret multivector (S _(S)) by performing a 0-Blade Reduction Operation on the original shared secret multivector (S _(S)) to obtain a scalar numerical value for the second Shared secret key (S_(S) ₂ ). The 0-Blade Reduction Operation may be found as a geometric product (S_(S) ₂ =(S _(S) S _(S))(S _(S) S _(S))^(†)) of the geometric product (S _(S) S _(S)) of the original shared secret multivector (S _(S)) and a Clifford conjugate (S _(S)) of the original shared secret multivector (S _(S)) and the geometric reverse ((S _(S) S _(S))^(†)) of the geometric product (S _(S) S _(S)) of the shared secret multivector (S _(S)) and the Clifford conjugate (S _(S)) of the original shared secret multivector (S _(S)). A further discussion of the 0-Blade Reduction Operation to calculate the second shared secret key (S_(S) ₂ ) may be found herein, below.

At process 304, the source computing device distributes the second shared secret key numeric value (S_(S) ₂ ) into second shared secret multivector (S _(S) ₂ ) coefficients where also not all coefficients are equal to each other (i.e., at least one coefficient should be different than the other coefficients). Once again, one skilled in the art will recognize that there are many approaches for distributing numeric data into several coefficients of a multivector (see herein, below, for disclosure of one such distribution method). The primary requirement for the distribution process from the numeric values of the second shared secret key (S_(S) ₂ ) to the second shared secret multivector coefficient values (S _(S) ₂ ) is that the source computing device (of FIG. 3A) and the destination computing device (of FIG. 3B) both know the process 304/314 such that the destination computing device can reconstruct the original message (M) by being able to independently recreate the second shared secret multivector (S _(S) ₂ ) from the second shared secret key numerical value (S_(S) ₂ ). As long as it is known to both the source computing device and the destination computing device, the distribution of numeric data to multivector coefficients may be performed differently between the message (M), the original shared secret (S_(S)), and the second shared secret key (S_(S) ₂ ).

At process 306, the source computing device encrypts the cryptotext multivector (C) as a function of Geometric Algebra geometric product operations on the message multivector (M), the shared secret multivector (S _(S)), and the second shared secret multivector (S _(S) ₂ ). Again, (M) to the nature of the geometric product operation of Geometric Algebra there are many possible variations of the geometric product operations that will provide similar degrees of confusion and diffusion. Some, but not all, of the potential geometric product calculations to encrypt the message data (M) include: geometric product “sandwich” (C=S _(S) M S _(S) ₂ to encrypt); and multivector based Sylvester's equation (C=S _(S) M+M S _(S) ₂ to encrypt).

FIG. 3B is a flow chart 310 of the destination computing device symmetric key operation for an embodiment. The decryption process 226 of the destination 204 of FIG. 2, in conjunction with the operation of the source computing device as described in the disclosure above with respect to FIG. 3A, may include processes 312-316 to use symmetric shared secret security keys to further enhance the security of an embodiment. At process 312, the destination computing device may independently generate/extract/obtain the second shared secret key (S_(S) ₂ ) from the original shared secret multivector (S _(S)) by performing the 0-Blade Reduction Operation on the original shared secret multivector (S _(S)) to obtain a scalar numerical value for the second shared secret key (S_(S) ₂ ). Again, the 0-Blade Reduction Operation may be found as a geometric product (S_(S) ₂ =(S _(S) S _(S))(S _(S) S _(S))^(†)) of the geometric product (S _(S) S _(S)) of the original shared secret multivector (S _(S)) and a Clifford conjugate (S _(S)) of the original shared secret multivector (S _(S)) and the geometric reverse ((S _(S) S _(S))^(†)) of the geometric product (S _(S) S _(S)) of the shared secret multivector (S _(S)) and the Clifford conjugate (S _(S)) of the original shared secret multivector (S _(S)). See also the further discussion of the 0-Blade Reduction Operation to calculate the second shared secret key (S_(S) ₂ ), which may be found herein, below.

At process 314, the destination computing device also distributes the second shared secret key numeric value (S_(S) ₂ ) into the second shared secret multivector (S _(S)) coefficients. Yet again, one skilled in the art will recognize that there are many approaches for distributing numeric data into several coefficients of a multivector (see herein, below, for disclosure of one such distribution method). Again, the primary requirement for the distribution process from the numeric values of the second shared secret key (S_(S) ₂ ) to the second shared secret multivector coefficient values (S _(S) ₂ ) is that the source computing device (of FIG. 3A) and the destination computing device (of FIG. 3B) both know the process 304/314 such that the destination computing device can reconstruct the original message (M) by being able to independently recreate the second shared secret multivector (S _(S) ₂ ) from the second shared secret key numerical value (S_(S) ₂ ). As long as it is known to both the source computing device and the destination computing device, the distribution of numeric data to multivector coefficients may be performed differently between the message (M), the original shared secret (S_(S)), and the second shared secret key (S_(S) ₂ ).

At process 316, the destination computing device decrypts the cryptotext multivector (C) as a function of Geometric Algebra geometric product operations on the cryptotext multivector (C), an inverse (S _(S) ⁻¹) of the original shared secret multivector (S _(S)), and an inverse (S _(S) ₂ ⁻¹) of the second shared secret multivector (S _(S) ₂ ) back into the message multivector (M). Once again, due to the nature of the geometric product operation of Geometric Algebra there are many possible variations of the geometric product operations that will provide similar degrees of confusion and diffusion. Some, but not all, of the potential geometric product calculations to decrypt the message data (M) include: geometric product “sandwich” (M=S _(S) ⁻¹ C S _(S) ₂ ⁻¹ to decrypt); and multivector based Sylvester's equation (M=(S _(S) ₂ +S _(S) ₂ +S _(S) ⁻¹ S _(S) ₂ S _(S) ₂ +S _(S))⁻¹(S _(S) ⁻¹ C S _(S) ₂ +C) to decrypt), the selection of which is based on the geometric product calculation used to encrypt the message data (M).

FIG. 4A is a flow chart 400 of the source computing device symmetric key and cryptotext masking operation for an embodiment. Similar to the disclosure with respect to FIG. 3A above, the encryption process 214 of the source 202 of FIG. 2 may further include processes 402-406 to use symmetric shared secret security keys to further enhance the security of an embodiment. At process 402, the source computing device may generate/extract/obtain a second shared secret key (S_(S) ₂ ) from the original shared secret multivector (S _(S)) by performing a 0-Blade Reduction Operation on the original shared secret multivector (S _(S)) to obtain a scalar numerical value for the second shared secret key (S_(S) ₂ ). The 0-Blade Reduction Operation may be found as a geometric product (S_(S) ₂ =(S _(S) S _(S))(S _(S) S _(S))^(†)) of the geometric product (S _(S) S _(S)) of the original shared secret multivector (S _(S)) and a Clifford conjugate (S _(S)) of the original shared secret multivector (S _(S)) and the geometric reverse ((S _(S) S _(S))^(†)) of the geometric product (S _(S) S _(S)) of the shared secret multivector (S _(S)) and the Clifford conjugate (S _(S)) of the original shared secret multivector (S _(S)). A further discussion of the 0-Blade Reduction Operation to calculate the second shared secret key (S_(S) ₂ ) may be found herein, below.

At process 404, the source computing device distributes the second shared secret key numeric value (S_(S) ₂ ) into second shared secret multivector (S _(S) ₂ ) coefficients where also not all coefficients are equal to each other (i.e., at least one coefficient should be different than the other coefficients). Once again, one skilled in the art will recognize that there are many approaches for distributing numeric data into several coefficients of a multivector (see herein, below, for disclosure some such distribution methods). The primary requirement for the distribution process from the numeric values of the second shared secret key (S_(S) ₂ ) to the second shared secret multivector coefficient values (S _(S) ₂ ) is that the source computing device (of FIG. 4A) and the destination computing device (of FIG. 4B) both know the process 404/416 such that the destination computing device can reconstruct the original message (M) by being able to independently recreate the second shared secret multivector (S _(S) ₂ ) from the second shared secret key numerical value (S_(S) ₂ ). As long as it is known to both the source computing device and the destination computing device, the distribution of numeric data to multi vector coefficients may be performed differently between the message (M), the original shared secret (S_(S)), and the second shared secret key (S_(S) ₂ ).

At process 406, the source computing device encrypts the cryptotext multivector (C) as a function of Geometric Algebra geometric product operations on the message multivector (M), the shared secret multivector (S _(S)), and the second shared secret multivector (S _(S) ₂ ). Again, due to the nature of the geometric product operation of Geometric Algebra there are many possible variations of the geometric product operations that will provide similar degrees of confusion and diffusion. Some, but not all, of the potential geometric product calculations to encrypt the message data (M) include: geometric product “sandwich” (C=S _(S) M S _(S) ₂ to encrypt); and multivector based Sylvester's equation (C=S _(S) M+M S _(S) ₂ to encrypt).

At process 408, in the process of the source computing device for converting the cryptotext multivector (C) into cryptotext numeric data (C) (see, fir example, the disclosure above with respect to process 216 of FIG. 2), the cryptotext multivector (C) is first converted into a pre-cipher cryptotext (C′) in accord with reverse operation of a cryptotext data coefficient distribution algorithm that is known to both the source computing device (FIG. 4A) and the destination computing device (FIG. 4B). The pre-cipher cryptotext (C′) is then masked as an exclusive or (C=C′XOR S_(S)) of the pre-cipher cryptotext (C′) and the original shared secret numeric value (S_(S)) to obtain/create the cryptotext numeric data (C) to send to the destination computing device.

FIG. 4B is a flow chart 410 of the destination computing device symmetric key and cryptotext masking operation for an embodiment. At process 412, in the process of the destination computing device for distributing the cryptotext numeric data (C) into the coefficients for the cryptotext multivector (C) (see, for example, the disclosure above with respect to process 222 of FIG. 2), is first unmasked through an exclusive or (C′=C XOR S_(S)) of the sent cryptotext numeric data (C) and the original shared secret numeric value (S_(S)) in order to obtain/create the pre-cipher cryptotext numeric data (C′) on the destination computing device. The destination computing device then distributes the pre-cipher cryptotext numeric data (C′) into the cryptotext multivector (C) using the cryptotext data coefficient distribution algorithm that is known to both the source and destination computing devices.

The remaining decryption process 226 of the destination 204 of FIG. 2, in conjunction with the operation of the source computing device as described in the disclosure above with respect to FIG. 4A, may include processes 414-418 to use symmetric shared secret security keys to further enhance the security of an embodiment. At process 414, the destination computing device may independently generate/extract/obtain the second shared secret key (S_(S) ₂ ) from the original shared secret multivector (S _(S)) by performing the 0-Blade Reduction. Operation on the original shared secret multivector (S _(S)) to obtain a scalar numerical value for the second shared secret key (S_(S) ₂ ). Again, the 0-Blade Reduction Operation may be found as a geometric product (S_(S) ₂ =(S _(S) S _(S))(S _(S) S _(S)) of the geometric product (S _(S) S _(S)) of the original shared secret multivector (S _(S)) and a Clifford conjugate (S _(S)) of the original shared secret multivector (S _(S)) and the geometric reverse ((S _(S) S _(S))^(†)) of the geometric product (S _(S) S _(S)) of the shared secret multivector (S _(S)) and the Clifford conjugate (S _(S)) of the original shared secret multivector (S _(S)). See also the further discussion of the 0-Blade Reduction Operation to calculate the second shared secret key (S_(S) ₂ ), which may be found herein, below.

At process 416, the destination computing device also distributes the second shared secret key numeric value (S_(S) ₂ ) into the second shared secret multivector (S _(S)) coefficients. Yet again, one skilled in the art will recognize that there are many approaches for distributing numeric data into several coefficients of a multivector (see herein, below, for disclosure of one such distribution method). Again, the primary requirement for the distribution/packing process from the numeric values of the second shared secret key (S_(S) ₂ ) to the second shared secret multivector coefficient values (S _(S) ₂ ) is that the source computing device (of FIG. 4A) and the destination computing device (of FIG. 4B) both know the process 404/416 such that the destination computing device can reconstruct the original message (M) by being able to independently recreate the second shared secret multivector (S _(S) ₂ ) from the second shared secret key numerical value (S_(S) ₂ ). As long as it is known to both the source computing device and the destination computing device, the distribution of numeric data to multivector coefficients may be performed differently between the message (M), the original shared secret (S_(S)), and the second shared secret key (S_(S) ₂ ).

At process 416, the destination computing device decrypts the cryptotext multivector (C) as a function of Geometric Algebra geometric product operations on the cryptotext multivector (C), an inverse (S _(S) ⁻¹) of the original shared secret multivector (S _(S)), and an inverse (S _(S) ₂ ⁻¹) of the second shared secret multivector (S _(S) ₂ ) back into the message multivector (M). Once again, due to the nature of the geometric product operation of Geometric Algebra there are many possible variations of the geometric product operations that will provide similar degrees of confusion and diffusion. Some, but not all, of the potential geometric product calculations to decrypt the message data (M) include: geometric product “sandwich” (M=S _(S) ⁻¹ C S _(S) ₂ ⁻¹ to decrypt); and multivector based Sylvester's equation (M=(S _(S) ₂ +S _(S) ₂ +S _(S) ⁻¹ S _(S) ₂ S _(S) ₂ +S _(S))⁻¹(S _(S) ⁻¹ C S _(S) ₂ +C) to decrypt), the selection of which is based on the geometric product calculation used to encrypt the message data (M).

Additionally, while the flow charts and flow chart details described above with respect to FIGS. 2-4 describe a methodology that may be embodied as a method or process, another embodiment may be recognized as a computer system, and/or as a source computer system and a destination computer system, that encrypts data, transfers the data, and decrypts the data by implementing the processes described above with respect to the flow chart and flow chart details of FIGS. 2-4. Further, in describing the computer system, and/or the source computer system and the destination computer system, that encrypts data, transfers the data, and decrypts the data, one, or more, individual processes described above for the methodology may be broken down and represented as a subsystem of the overall encryption computer system. A subsystem of the computer system, and/or the source computer system and the destination computer system, that encrypts data, transfers the data, and decrypts the data may be assigned, in whole or in part, to a particular hardware implemented system, such as a dedicated Application Specific Integrated Circuit (ASIC) or Field Programmable Gate Array (FPGA). One or more subsystems, in whole or in part, may alternatively be implemented as software or firmware instructions defining the operation of a computer system with specific regard to the one or more subsystems implemented as software or firmware instructions. The software or firmware instructions may cause the Central Processing Unit, memory, and/or other systems of a computer system to operate in particular accordance with the particular one or more subsystems designated features.

Section 2: Additional Descriptions of EDCE Message Encryption/Decryption

The disclosure below provides a simplified example of the operations and data relationships during the performance of an EDCE, embodiment. The amount of data, the type of data, and the particular data values shown and described in the example are not meant to represent any particular real system, but are provided only for the purpose of showing the operations and data relationships of an embodiment. Further, the embodiments described below are not meant to restrict operations to particular data types, encryption shared secret key exchange techniques, text to numeric and back conversion techniques, and/or number to multivector coefficient assignment techniques.

In addition to the utilization of the Geometric Algebra geometric product as a novel encryption primitive, the various embodiments may be comprised of functional blocks, each of which may be tailored as described according to objectives for scope, capability and security. The following sections provide a mathematical and numerical description of one or more example embodiments of these functional blocks. The numerical results in the examples are generally derived from Geometric Algebra executing in the C programming language.

A. Packing and Unpacking Multivectors

Contents

-   -   1) Text to Number     -   2) Number to text     -   3) Multivector data structure     -   4) Number to multivector     -   5) Multivector to number

11) Text to Number

For the example EDCE embodiment described herein, each text message needs to be converted to a number in order to become a valid operational unit for all EDGE computations. For the embodiments shown herein, the numbers are typically shown in base 10, but the various embodiments may choose other number bases as desired by the system designer. For instance, a hex (base 16) representation may provide particular advantages when dealing with ASCII numerical representations as standard ASCII has a representation based on the numbers 0-127 (i.e., 2⁷), which is one power of two (i.e., hex is 2⁸) less than the typical 8 bits represented by a hex number of xFF. According to the ASCII character-encoding scheme, symbols such as the letters a, b, c and so on, are represented in order formats (such as binary, decimal, octets, hexadecimal, etc.), which are described in the ASCII printable code chart, a table that presents the relationship between formats. So the letters “a,” if and “c” in ASCII decimal code are 97, 93 and 99, respectively.

As an example, assume that the plaintext text message is “message.” In ASCII decimal code, this is represented as follows:

m e s s a g e 109 101 115 115 97 103 101

With this relationship between symbols and decimal numbers, the conversion from text to number in base 10, using the text “message”, is executed as follows:

The variable n represents the final number of the conversion from text to number. We start defining this variable to zero. So, n=0.

100671 Then we create an array with the ASCII decimal codes for each letter of the message:

-   -   text “message”     -   ASCII_array_from_“message”=[109, 101, 115, 1.15, 97, 103, 101]

This array has a size of 7 elements, thus array size=7

Then, for each value of the array of ASCII characters, in a loop, we will

-   -   (i) multiply n by 256 (we chose 256 because it is a power of two         greater than the largest number in the ASCII printable code         chart, so we are reserving a space of 8 bits, since 2⁸=256)     -   (ii) sum with the equivalent ASCII decimal code, assigning the         result to the same initial a variable, as follows:     -   For i=0; i<array_size; i++         -   n=n*256+ascii_array_from_message[i]

Note the details of each iteration below:

n = 0 For i = 3 array = [109, 101, 115, 115, 97, 103, n = 7169395 * 256 + 115 101] n = 1835365235 array_size = 7 For i = 4 For i = 0 n = 1835365235 * 256 + 97 n = 0 * 256 + 109 n = 469853500257 n = 109 For i = 5 For i = 1 n = 469853500257 * 256 + 103 n = 109 * 256 + 101 n = 120282496065895 n = 28005 For i = 6 For i = 2 n = 120282496065895 * 256 + 101 n = 28005 * 256 + 115 n = 30792318992869221 n = 7169395

By performing the above calculation, the final value of a is; 30792318992869221

Thus, the plain text “message” as a number in base 10 is equal to 30792318992869221. Once we have a base 10 number it is possible to perform the calculations described herein for message encryption. If desired, entropy may be added at this step by performing transformations on the ASCII codes, such as addition or modulo operations. No such entropy adding transformations are used in the examples that follow.

2) Number to Text

After performing various calculations, a base 10 number is transmitted and received. From the above example of a message multivector, the coefficients are concatenated to form a number string, The “number to text” conversion process for this number string also uses the ASCII printable code chart, but the recovery routine is different from the “text to number” conversion. The procedure is described below:

We start with the variable s, which is an empty string that will become the final text recovered from the input number, (Note: the symbol ““”” is from the C-language and means empty string)

s=“ ”

The input number is 30792318992869221.

n=30792318992869221

Now, we perform a loop until n is “emptied”, since this number refers to an actual text message. This means the loop will stop when n is equal to zero. In each loop iteration, we will recover, from the last to the first, each ASCII decimal code correspondent to the text that we are retrieving. To do that, we will perform a bitwise AND operation using the value 0×FF (which is 256-1 in hexadecimal format or in base 16). We will convert the code to character symbols and concatenate with the current string, always putting the most recent recovered character in the front of the string. Lastly, we will update the value of n by performing a right shift of 8 bits.

Let's say that the function “get_char” converts the ASCII decimal code to a character symbol.

The procedure is as follows:

while n>0

s=get_char(n AND 0×FF)+s

Note the details of each iteration below:

-   -   s=“ ”     -   n=70392318992869221     -   while n>0

s=get_char(n AND 0×FF)+s

Iteration 0: Iteration 4: ascii_code = n AND 0xFF = 101 ascii_code = n AND 0xFF = 115 s = get_char(ascii_code) + s s = get_char(ascii_code) + s s = “e” s = “ssage” n = n >> 8 n = n >> 8 n = 120282496065895 n = 28005 Iteration 1: Iteration 5: ascii_code = n AND 0xFF = 103 ascii_code = n AND 0xFF = 101 s = get_char(ascii_code) + s s = get_char(ascii_code) + s s = “ge” s = “essage” n = n >> 8 n = n >> 8 n = 469853500257 n = 109 Iteration 2: Iteration 6: ascii_code = n AND 0xFF = 97 ascii_code = n AND 0xFF = 109 s = get_char(ascii_code) + s s = get_char(asscii_code) + s s = “age” s = “message” n = n >> 8 n = n >> 8 n = 1835365235 n = 0 Iteration 3: ascii_code = n AND 0xFF = 115 s = get_char(ascii_code) + s s = “sage” n = n >> 8 n = 7169395

Thus, the number 30792318992869221 is converted to the text string “message,” which agrees with the original plaintext.

3) Multivector Data Structure

For the example embodiment discussed herein, any number in base 10 may be a coefficient of a multivector element. A multivector may contain arbitrary data, or data that is a result of a series of operations. A base 10 number may also be represented in multivector form by distributing pieces of this number string to the coefficients in the multivector. Multivectors that are 2D have 4 elements/coefficients available to pack with pieces of this number string, a 3D multivector has 8 elements, and 4D has 16, EDCE, has been demonstrated up to at 7D. A 4D multivector with 16 elements is written as:

Ā=a ₀ +a ₁ e ₁ +a ₂ e ₂ +a ₃ e ₃ +a ₄ e ₄ +a ₁₂ e ₁₂ +a ₁₃ e ₁₃ +a ₁₄ e ₁₄ +a ₂₃ e ₂₃ +a ₂₄ e ₂₄ +a ₃₄ e ₃₄ +a ₁₂₃ e ₁₂₃ +a ₁₂₄ e ₁₂₄ +a ₁₃₄ e ₁₃₄ +a ₂₃₄ e ₂₃₄ +a ₁₂₃₄ e ₁₂₃₄

4) Number to Multivector

Given the base 10 number string 30792318992869221, this string may be a single coefficient of, say, a 2D multivector, as follows:

0+30792318992869221e ₁ +e ₂ +e ₁₂

EDCE has been demonstrated where the number string distributed to an element of the multivector exceeds 4,000 digits, However, the base 10 number in our example will typically be “distributed” in an ad hoc manner across all the multivector elements, such as:

30792+31899e ₁+28692e ₂+21e ₁₂

The above distribution is called “number to multivector.” For an EDCE embodiment, the method of distributing the number string may be according to any of a variety of algorithms as long as the method is known and used by both the sending and receiving entities. To increase cryptographic “confusion,” the distribution algorithm may include shuffling of the assignments to elements, performing functional operations on numbers assigned to elements or changing the algorithm between messages in a conversation. More operations increase encryption entropy.

Again, for the various embodiments, the “payload” may be packed in the values of the scalars and coefficients of the multivector elements. To ensure that EDCE systems may perform properly, it is necessary to have some limitations on the coefficient values chosen for the multivectors, For instance, the Rationalize operation on multivectors yields zero when all multivector coefficients are equal. Such multivectors having all equal coefficients have no inverse and the geometric product of such multivectors having all equal coefficients with another multivector has no inverse. As discussed in more detail below, the decryption methodology for EDCE systems utilize the inverse of the cryptotext multivector being decrypted and of the security key(s) multivector to perform the decryption. Therefore, the cryptotext multivector being decrypted should not have all equal value coefficients. One means to ensure that the cryptotext multivector being decrypted does not have all equal value coefficients is to have the packing/coefficient distribution method ensure that not all coefficients are equal to each other (i.e., at least one coefficient should be different than the other coefficients) when creating the shared security multivector(s) and the data message multivectors. For an embodiment of the EDGE that simply transfers the data message, ensuring that that not all coefficients are equal to each other when creating the shared security multivector(s) and the data message multivectors will ensure that the cryptotext multivector to be decrypted will not have all equivalent coefficients.

Additionally, separate multivectors may be encoded for many purposes, such as a shared secret (defined below), authentication information, and timestamps. In addition to the encryption and decryption of a message, the EDCE multivector format and Geometric Algebra foundation of an EDCE embodiment may enable a single transmission to contain far more than just cryptotext, including dummy data to increase encryption security, command instructions for additional operations, and/or configuration data for the additional operations.

The simple distribution method used in the EDCE embodiment examples below is described as follows: Let the input base 10 number string 30792318992869221. We count the number of digits and determine that the number size is 17 digits. We then determine how to distribute these digits to the elements of a multivector. Considering a multivector of 2D, which has 4 elements, we apply the following equation:

${ep} = {\left( \frac{{size}_{number}}{{Number}_{elements}} \right) + 1}$ ${ep} = {{\left( \frac{17}{4} \right) + 1} = 5}$

Where ep is “each portion” length.

Now we have the original base 10 number and its size (17), the multivector structure (2D, 8 elements) and the length of each element (5). Now we need to “slice” the base 10 number in order to distribute each part as a coefficient of the new multivector.

Computationally, the procedure is as follows:

Base 10 number 30792318992869221 Number size 17 Number of 4 multivector elements Each portion length 5 First element 30792 Second element 31899 Third element 28692 Fourth element 21

This creates the following multivector:

30792+31899e ₁+28692e ₂+21e ₁₂

A First Alternative “Number to Multivector” Distribution Method:

To increase entropy, the conversion from number to multivector may include an intermediate step of shuffling the digits of the base 10 number representation.

As before, let the base 10 number =30792318992869221, Even though this number has an odd number of digits (17), it can be split into two sequences as follows:

$n = {\underset{\underset{s_{1}}{}}{30792318}\mspace{11mu} \underset{\underset{s_{2}}{}}{992869221}}$

The sequence may be shuffled to n′ as:

$n^{\prime} = {\underset{\underset{s_{2}}{}}{992869221}\mspace{11mu} \underset{\underset{s_{1}}{}}{30792318}}$

Now, n′ is 99286922130792318, which is the new number to be distributed to the elements of the multivector The number of hits of n′=57.

The following bitwise operations require a minimum magnitude (>2^(number of bits in n′)) of the numbers involved in order to correctly generate and recover data. To comply with such a requirement, we need to find an exponent b related to the number of bits n′ that has to be a power two. Since the number of bits of n′ is equal to 57, we make b equal to the next power of two number, which turns to be 64. Hence we use 2^(b)=2⁶⁴ as the arithmetic parameter for the binary operations.

Compute n″:

n″=(n′+2^(b) +s ₁)+2^(b) +s ₂

n″=(99286922130792318+2⁶⁴+992869221)+2⁶⁴+30792318

n″=33785588866960916932803988894906868159702738740312398462

Converting n″ to multivector would give the following 2D multivector representation:

M=337855888669609+169328039888949e ₁+68681597027387e ₂+40312398462e ₁₂

To recover the original number from the above multivector, the procedure is as follows:

Since the current multivector is 2D, we will recover the sequences in 2 steps. The number of steps is equal to the number of sequences. For recovering the sequences, we will apply the equations bellow, making use of the binary operators AND and >>(right shift).

n″=multivector_to_number ( M )

n″=3378558886696091693203988894906868159702738740312398462

Step 1;

s ₁ =n″ AND (2⁶⁴−1)=30792318

Step 2:

s ₂=(n″>>64) AND (2⁶⁴⁻¹)=992869221

Now, concatenate the sequences to recover the original n=3079231899 2869221.

A Second Alternative “Number to Multivector” Distribution Method:

Another relationship for packing the coefficients of the multivector is to ensure that the coefficients of the multivector representation of the plaintext numeric message follow a mathematical data organization between the value of the plaintext numeric message and at least one of the values of the coefficients of the multivector representation of the plaintext numeric message where the mathematical operations incorporating the one or more values of the multivector coefficients have a result equal to the original plaintext numeric message value. The mathematical relationship may include: addition of at least one coefficient of the multivector coefficients, subtraction of at least one coefficient of the multivector coefficients, addition of a constant value, subtraction of a constant value, multiplication of at least one coefficient of the multivector coefficients by a constant value, and division of at least one coefficient of the multivector coefficients by a constant value. The location of the various mathematical operations relative to the particular locations of the coefficients in the multivector representation should also be consistently applied to all source numeric data messages converted to a multivector as well as for result multivectors converted to a result numeric data value in a particular encryption/decryption pathway, For example, for a mathematical relationship that includes both addition and subtraction operations, and for a three dimensional multivector which has eight possible coefficients in the multivector representation (e.g., c₁, c₂, c₃, c₁₂, c₁₃, c₂₃, and c₁₂₃, numbered so as to correspond with the unit vector associated with each coefficient), if the coefficients for the e₂ and e₁₂ unit vectors (i.e., c₂ and c₁₂) are subtracted in the calculation of the mathematical relationship for a source numeric data message conversion to a multivector, the destination numeric message should also treat the c₂ and c₁₂ coefficients as being subtracted when doing a multivector to number conversion with the same mathematical relationship. In fact, obtaining a numeric value from the coefficients of a numeric data message multivector “packed” using a mathematical relationship is relatively simple and straight forward. To obtain the numeric data message value, simply perform the mathematical relationship equation for the numeric data message multivector using the values of the multivector coefficients plugged into the mathematical relationship equation, Other than the location of additions and subtractions within the mathematical relationship of the coefficients, the actual values of the coefficients may be selected as desired by a user so long as the mathematical relationship equals the original numeric value being encrypted, One skilled in the art will recognize that there are many, perhaps even an infinite, number of ways to select coefficient values that meet the stated criteria/restrictions and that each of those ways will create a satisfactory EDCE embodiment so long as the stated criteria/restrictions are, in fact, met.

Handling Special Cases:

Regardless of the method of distribution, the leading digit in any coefficient must be non-zero. For example, let the number to be converted to multivector be 30792318990869221. Applying the distribution method shown above would result in:

30792+31899e ₁+08692e ₂+21e ₁₂

Note the third element=08692e₂. The computer will treat this number as 8692. When converting back from multivector to number, instead of 30,792,318,990,869,221 we would have 3,079,231,899,869,221, which is not the same number (commas added only for comparability).

To avoid this outcome, it is necessary to include verification in the algorithm that the first number of a coefficient is non-zero. If it is zero, this number should be placed as the last number in the coefficient of the previous element of the multivector. So, the correct result of the conversion of the number 30792318990869221 to a 2D multivector is:

30792+318990e ₁+8692e ₂+21e ₁₂

5) Multivector to Number

The distribution method used in the EDCE embodiment examples below is described as follows:

For the distribution (i.e., “packing”) method disclosed above for parsing the string representation of a base 10 number to obtain the coefficient values, converting a multivector to a base 10 number is simply the reverse process of concatenating the coefficients of the multivector in order to form a base 10 number.

As an example:

-   -   The multivector: 30792+31899e₁+28692e₂+21e₁₂ becomes:         30792318992869221.

Note that in the core EDCE protocol of some of the example embodiments herein, only base 10 number strings are transmitted, not multivectors, but sending only base 10 number strings is not a requirement for an embodiment. In some embodiments, the number may be sent using a numeric variable representation such as an integer or floating point data type. Further, while not typical of most encryption systems, instead of sending a single cryptotext number (C), an embodiment may also simply skip the step of converting the multivector (C) into cryptotext numeric data (C), and directly send a representation of the cryptotext multivector (C) without first converting the cryptotext multivector (C) into cryptotext numeric data (C). The transmission may be implemented as a series of transfers of the coefficients or as some form of records/packets that define a data structure that carries the coefficient data of the cryptotext multivector (C). As would be the case for a more typical encryption system, if the process to convert the cryptotext multivector (C) into cryptotext numeric data (C) is used to convert the cryptotext multivector (C) into cryptotext numeric data (C), it is necessary for any computing device/system that wishes to operate on the cryptotext multivector (C) to have knowledge of the particular conversion methodology so that the computing device/system may properly recreate the cryptotext multivector (C).

B. Shared Secret

A “Shared Secret” is a fundamental element in cryptography. A Shared Secret enables secure communication between two or more parties. For the various embodiments the Shared Secret is a number string of digits that may be packed into a multivector in the manner shown above. The “Shared Secret Multivector” may be used to operate on other multivectors, such as creating the geometric product of the Shared Secret Multivector and the message multivector.

A variety of methods are already in practice to establish the Shared Secret between sources and destinations. As disclosed herein, the conversion of a “Shared Secret” number to a “Shared Secret Multivector” is completely novel. Communication end-point devices may be “pre-conditioned” with a unique identifier (number string) known only to the system administrators. In a public/private key environment such as RSA, the Shared Secret may be encrypted by the source using only the destination's public key. The method used in the examples below is the Diffie-Hellman key exchange protocol. This is a convenient, widely adopted method to establish a number string Shared Secret. However, any method that securely produces a shared number string is suitable for use with the various embodiments.

The Diffie-Hellman protocol uses the multiplicative group of integers modulo p (see, for example, https://en.wikipedia.org/wiki/Multiplicative_group_of_integers_modulo_(—n)), where p is prime (see, for example, https://en.wikipedia.org/wiki/Prime_number), and g is a primitive root modulo p (see, for example,

https://en.wikipedia.org/wiki/Primitive_root_modulo_n and https://en.wikipedia.org/wiki/Modular_arithmetic). These two values are chosen in this way to ensure that the resulting shared secret can take on any value from I to A simple example of Diffie-Hellman follows:

-   -   Alice and Bob first agree on using the same root modulo p and         base g.     -   Alice chooses a secret integer a (Alice's password) and creates         her signature S_(A) ⁰ as

S _(A) ⁰ =g ^(a)modp

-   -   and sends it to Bob. (Note: the superscript 0 is a placeholder         for later use, if any)     -   Similarly, Bob chooses a secret integer b (Bob's password) and         creates his signature S_(B) ⁰ as

S _(B) ⁰ =g ^(b)modp

-   -   and sends it to Alice.     -   Alice and Bob are able to compute the shared secret key S_(S) as         follows:         -   Alice computes S_(S)=(S_(B) ⁰)^(a)mod p         -   Bob computes S_(S)=(S_(A) ⁰)^(b)mod p     -   The keys computed by Alice and Bob are the same. This is the         Shared Secret.

Note that DiffieHellman protocol is not limited to negotiating a key shared by only two participants. Any number of users can take part in the agreement by performing iterations of the protocol and exchanging intermediate data.

Numeric Example

Assume the following:

Selected and shared prime number p 821309937410771225846473211469 Selected and shared base number g 773039877053085816220792898603 Alice's secret a 325952971969365237094889914154 Bob's secret 289473367541568799631931700475

To compute S_(A) ⁰, Alice's public signature and S_(B) ⁰, Bob's public signature:

S _(A) ⁰ =g ^(a)modp

S _(B) ⁰ =g ^(b)modp

S _(A) ⁰=49009686585026240237091226039

S _(B) ⁰=28663920458684997936652161962

To compute the shared secret, both Alice and Bob will perform the following equation, which will generate the same value for both, thus the shared secret is reference as S_(S):

S _(S) =S _(B) ⁰ ^(a) mod p

S _(S) =S _(A) ⁰ ^(b) mod p

S _(S)=374101092446920532886590141005

The shared secret number string above may be distributed as before to create a Shared Secret Multivector:

S _(S)=37410109+24469205e ₁+32886590e ₂+141005e ₁₂

In a similar manner the S_(A) ⁰ and S_(B) ⁰ number string for Alice and Bob can be distributed in a multivector format to create S _(A) ⁰ and S _(B) ⁰. These multivectors for Alice and Bob are essential to the additional EDCE security features discussed in Section 2.

C. Cryptotext Creation

The cryptotext is created using the EDGE primitive which is the geometric product of the Message multivector and one or more other multivectors. In the most basic form, the cryptotext multivector may be the geometric product of the Message multivector and the Shared Secret Multivector.

The procedure is defined as follows, Let the plaintext message be “this is a test.” By applying the “text to number” conversion, we will get the plaintext message as the number:

2361031878030638688519054699098996

By applying the “number to multivector” conversion using a 2D multivector structure the plaintext multivector is:

M =236103187+803063868e ₁+851905469e ₂+9098996e ₁₂

Using the Shared Secret multivector that was determined above:

S _(S)=37410109+24469205e ₁+32886590e ₂+141005e ₁₂

The cryptotext multivector can be defined as the geometric product:

C=M S _(S)

Using methods for calculating the geometric product of M and S _(S) implemented in C programming code, the cryptotext multivector C described above is calculated as:

C=56497963248932053+35999076139905242e ₁+39525095983837611e ₂+5938268771181474e ₁₂

In order to be transmitted, as a payload, C now may be converted to a base 10 number, through the “multivector to number” conversion process described above.

c ₁₀=5649796324893205335999076139905242395250959838376115938268771181474

To increase the entropy of the Cryptotext Multivector, the Geometric Product of the Message Multivector may be taken with more than one other multivector or by using the same multivector twice to form a sandwich or by the addition of left and right multivector operations on the same Shared Secret Multivector. Two examples of these types are C=S _(S) M S _(S) and C=S _(S) M+M S _(S). The use of these primitives and their inverse is shown in the flow charts in FIGS. 3 and 4.

Note that there are several alternative methods to construct the Cryptotext Multivector. One alternative is to encrypt the plaintext message using a conventional symmetric cipher such as AES, converting the number string output of that cipher to multivector format and use this multivector in calculating the geometric product with S _(S), which yields C. This alternative may be practiced during the transition to EDGE within the enterprise to preserve backward compatibility with legacy encryption systems.

D. Decryption

Since Bob has the same shared secret of the source, he can open the cryptotext by performing a geometric product of the cryptotext multivector and the inverse of the shared secret multivector. When Bob receives C₁₀, he will apply the appropriate number to multivector conversion to get:

C =56497963248932053+3599906139905242e ₁+39525095983837611e ₂+5938268771181474e ₁₂

To recover the plaintext multivector M Bob determines the geometric product of the cryptotext multivector and the inverse of the Shared Secret multivector.

M=C S _(S) ⁻¹

The method to determine S _(S) ⁻¹ given S _(S) is described in more detail in Appendix A. It has been computed as:

${\overset{\_}{S}}_{S}^{- 1} = {0.000026073076962327080434360644193616198433147472820027689698131\mspace{31mu} + {0.000000825457638290213311181056473878297303908013995989312703222\mspace{25mu} e_{1}} + {\left( {- 0.00000302201357686494869754394018652731020525315836555058082087}\mspace{14mu} \right)e_{2}} + {\left( {- 0.000001476164784851810000367564890720274369477622677012150966249}\mspace{14mu} \right)e_{3}} + {\left( {- 0.000001979165546727098436715224982579657444314140144210619540629}\mspace{14mu} \right)e_{12}} + {\left( {- 0.00000418289758885502671193398507131606997607580156691151575708555}\mspace{14mu} \right)e_{13}} + {\left( {- 0.00000284035735548604816280225401518433913770465475305727734285}\mspace{14mu} \right)e_{23}} + {\left( {- 0.00000058399229726787265796889780817224702593392912954493277677}\mspace{14mu} \right)e_{123}}}$

Thus,

M=236103187+803063868e ₁+851905469e ₂+9098996e ₁₂

The multivector M is converted to a base 10 number:

M₁₀=2361031878030638688519054699098996

Finally, this number is converted to text using the “number to text” procedure described above, resulting in:

M _(plain text)=“this is a test”

E. EDCE Flow Chart (FIGS. 5-6)

FIG. 5 is a flow chart 500 of an embodiment for an Enhanced Data-Centric Encryption (EDCE) encryption/decryption performed by using a geometric product “sandwich.”

Setup (502): The sequence is initiated by establishing the signature and shared secret multivectors. Here the Diffie-Hellman procedure 508 is shown but other asymmetric key ciphers such as RSA may be used to generate a number string known only to the source 504 and the destination 506. Alternatively, end-point devices may be “pre-conditioned” with a secret (number string) known to the system administrator from which the session multivectors may be constructed. The Diffie-Hillman procedure 508 sets up/creates the shared secret keys 510 and then the setup 502 creates multivectors of the Diffie-Hillman keys 510 in the multivector setup 512.

Source (504): The Message Multivector 516 is constructed at the create message operation 514 by concatenating the message ASCII code string to a number string and then distributing that number to the coefficients of the message multivector at 514. The method of distributing to coefficients uses a prescribed algorithm known and used by both the source 504 and the destination 506.

The Message Multivector 516 is then encrypted 518 by computing the geometric product of the message and Shared Secret multivectors. FIG. 5 shows the Cryptotext Multivector 520 as the “sandwich” of geometric :products C=S _(S) M S _(S). The coefficients of the Cryptotext Multivector 520 are then concatenated into a base 10 number string, C (524), and transmitted through a user-defined dispatch function 526 over an electronic network/bus communication channel 528.

Destination (506): C (532) is received through a user-defined operation 530 and converted back to the Cryptotext Multivector 536 using the prescribed distribution method 534. The destination 506 computes the multivector inverse of the Shared Secret Multivector and uses this result in the decrypt equations 538 such as M=S _(S) ⁻¹ C S _(S) ⁻¹ to recover the Message Multivector 540. The Message Multivector 540 is then converted to a number string and then to plaintext at 542.

FIG. 6 is a flow chart 600 of an embodiment for the EDGE encryption/decryption by using Sylvester's equation,

Setup (602): The sequence is initiated by establishing the signature and shared secret multivectors, here the Diffie-Hellman procedure 608 is shown but other asymmetric key ciphers such as RSA may be used to generate a number string known only to the source 604 and the destination 606. Alternatively, end-point devices may be “pre-conditioned” with a secret (number string) known to the system administrator from which the session multivectors may be constructed. The Diffie-Hillman procedure 608 sets up/creates the shared secret keys 610 and then the setup 602 creates multivectors 612 of the Diffie-Hillman keys in the multivector setup 612.

Source (604): The Message Multivector 616 is constructed at the create message operation 614 by concatenating the message ASCII code string to a number string and then distributing that number to the coefficients of the message multivector at 614, The method of distributing to coefficients uses a prescribed algorithm known and used by both the source 604 and the destination 606.

The Message Multivector 616 is then encrypted 618 by computing the geometric product of the message and Shared Secret multivectors. FIG. 6 shows the Cryptotext Multivector as the sum of two geometric products C=S _(S) M+M S _(S). The coefficients of the Cryptotext Multivector 620 are then concatenated into a base 10 number string, C (624), and transmitted through a user-defined dispatch function 626 over an electronic network/bus communication channel 628.

Destination (606): C (632) is received through a user-defined operation 630 and converted back to the Cryptotext Multivector 636 using the prescribed distribution method 634. this result in the decrypt equations 638 such as M=(S _(S)+S _(S)+S _(S) ⁻¹ S _(S) S _(S)+S _(S))⁻¹(S _(S) ⁻¹ C S _(S)+C) to decrypt). Where the encryption uses the sum of two geometric products C=S _(S) M+M S _(S) the decryption applies multivector based “Sylvester's Equation” to recover the Message Multivector 640. The Message Multivector 640 is then converted to a number string and then to plaintext at 642.

F. Symmetric Key Pair Encryption/Decryption from 0-Blade Reduction Operation (FIG. 7) 0-Blade Reduction Operation

In order to increase security to the Geometric Algebra encryption primitives, a pair of symmetric shared secret keys may be used instead of a single shared secret key. The following lists the processes that may be used to generate/extract/obtain the second shared secret multivector (S _(S) ₂ ) from the original shared secret numeric value key (S_(S)).

-   -   1. The original shared secret numeric value (S_(S)), which may         be obtained from a key exchange procedure, such as, but not         limited to, the Diffie-Hellman key exchange process, may be used         as the first shared secret numeric key of the pair of symmetric         shared secret keys;     -   2. Using a multivector distribution operation, the original         shared secret numeric key (S_(S)) may be loaded into a         multivector representation, which may be denoted as (S _(S)).     -   3. A 0-Blade Reduction Operation on the original shared secret         multivector (S _(S)) may be performed in order to         extract/generate/obtain a scalar value that is the second shared         secret numeric key (S_(S) ₂ );     -   4. The scalar that results from 0-Blade Reduction Operation,         which has been defined as (S_(S) ₂ ), may be loaded into a         multivector through another multivector coefficient distribution         operation with the resulting multivector being the second shared         secret multivector (S _(S) ₂ ).

FIG. 7 is a block diagram 700 illustrating generating/extracting/obtaining a second shared secret multivector key (S _(S) ₂ ) 712 from the original shared secret multivector (S _(S)) 704 for an embodiment. The original shared secret multivector (S _(S)) 704 may be used to encrypt and decrypt data as the first shared secret multivector key of a pair of symmetric shared secret multivector keys. For the Geometric Algebra encryption primitive 702, the original shared secret multivector (S _(S)) 704 is operated on by the 0-Blade Reduction Operation 706 (S_(S) ₂ =(S _(S) S _(S))(S _(S) S _(S))^(†)). The 0-Blade Reduction Operation 706 results in the scalar value of the second shared secret numeric key (S_(S) ₂ ) 708. number to multivector coefficient distribution process 710 converts the second shared secret numeric key (S _(S) ₂ ) into a second shared secret multivector (S _(S) ₂ ) 712. The second shared secret multivector (S _(S) ₂ ) may then be used to encrypt and decrypt data as the second shared secret multivector key of a pair of symmetric shared secret multivector keys.

Geometric Algebra Encryption Primitives

Primitive 1“Sandwich”/Triple Product

Encryption

The first encryption primitive can be created through a sequence of geometric products using the pair of keys generated via the 0-Blade Reduction Operation (described herein, above) as follows:

C=S _(S) M S _(S) ₂

Decryption

The decryption process uses the previously defined inverse multivector as follows:

M=S _(S) ⁻¹ C S _(S) ₂ ⁻¹

Primitive 2 Multivector based Sylvester's Equation

Encryption

The well-known Sylvester's equation is employed here to generate a second encryption primitive which also uses the pair of symmetric encryption keys generated via the 0-Blade Reduction Operation (described herein, above) as follows:

C=S _(S) M+M S _(S) ₁

Decryption

The decryption operation involves the closed-form solution of the Sylvester's equation for 3-dimensional multivector space as follows:

M =(S _(S) ₁ +S _(S) ₂ +S _(S) ⁻¹ S _(S) ₁ S _(S) ₂ +S _(S))⁻¹( S _(S) ⁻¹ C S _(S) ₂ +C )

Note that a solution for higher dimensions requires a different formula. Further note that if the original shared secret (S_(S)) is generated using an encrypted/secure key exchange, such as, but not limited to the Diffie-Hellman process discussed in more detail herein, there is no transmission of the original shared secret multivector (S _(S)) and, consequently, no transmission of the second shared secret multivector (S _(S) ₂ ). Still further note that since the second shared secret multivector (S _(S) ₂ ) is a result of a one-way function, the use of the second shared secret multivector (S _(S) ₂ ) in either of the Geometric Algebra encryption primitive operations above, further guarantees security.

Numerical Examples for Encryption and Decryption With Doubled Shared-Secret in 3 Dimensions

Let the message multivector M be:

M=23+24e ₁+19e ₂+31e ₃+23e ₁₂+30e ₁₃+21e ₂₃+268e ₁₂₃

and the original secret multivector S _(S) be:

S _(S)=29+27e ₁+331e ₂+28e ₃+23e ₁₂+17e ₁₃+20e ₂₃+215e ₁₂₃

From the original secret multivector S _(S), create a scalar by applying a 0Blade Reduction Operation as follows:

scalar=( S _(S) S _(S))( S _(S) S _(S))^(†)

scalar=2281454761

Then create the second secret multivector S _(S) ₂ converting the scalar to a multivector, as follows:

S _(S) ₂ =22+81e ₁+45e ₂+47e ₃+61e ₁₂+0e ₁₃+0e ₂₃0e ₁₂₃

Geometric Product “Sandwich” or Geometric Triple Product

In order to encrypt the multivector M, compute the geometric product “sandwich” as follows:

C=S _(S) M S _(S) ₂

C=−2797319+(−5355930)e ₁+(−3496422)e ₂+(−3343014)e ₃+(−3868508)e ₁₂+(−1313899)e ₁₃+1690341e ₂₃+1961527e ₁₂₃

and recover the message multivector M as follows:

M=S _(S) ⁻¹ C S _(S) ₂ ⁻¹

M=23+24e ₁+19e ₂+31e ₃+23e ₁₂+30e ₁₃+21e ₂₃+268e ₁₂₃

Multivector Based Sylvester's Equation

Another way to encrypt the message multivector M is by applying the multivector based Sylvester's equation:

C=S _(S) M+M S _(S) ₂

C=−53068+(−5585)e ₁+14297e ₂+(−27003)e ₃+29328e ₁₂+(−25163)e ₁₃+35753e ₂₃+22982e ₁₂₃

and recover the message multivector M as follows:

M =( S _(S) ₂ +S _(S) ₂ +S _(S) ⁻¹ S _(S) ₂ S _(S) ₂ +S _(S))⁻¹( S _(S) ⁻¹ C S _(S) ₂ +C )

M=23+24e ₁+19e ₂+31e ₃+23e ₁₂+30e ₁₃+21e ₂₃+268e ₁₂₃

G. An Unbreakable Primitive Using Geometric Algebra and Arithmetic Functions Example with Secret Sharing and 3D Multivectors

Set Up

A multivector may act as a Geometric Algebra object such that components of multi-dimensions and Clifford k-vectors are present. An example is:

M=a ₀ +a ₁ ē ₁ +a ₂ ē ₂ +a ₃ ē ₃ +a ₁₂ ē ₁₂ +a ₂₃ ē ₂₃ +a ₃₁ ē ₃₁ +a ₁₂₃ ē ₁₂₃

which shows the components:

a ₀

scalar−known as 0-blade or 0-vector

a ₁ ē ₁ +a ₂ ē ₂ +a ₃ ē ₃

3D vector or 1-blade or vector

a ₁₂ ē ₁₂ +a ₂₃ ē ₂₃ +a ₃₁ ē ₃₁

2-blade or bi-vector

a ₁₂₃ ē ₁₂₃

3-blade or tri-vector

A typical, but not the only, arithmetic function used for secret sharing is the Diffie-Hellman function, which is based on cyclic groups with element g; for example:

S _(S) =g ^(ab)modp

where S_(S) is a shared secret which can be used by both the source and destination sides and where the operation g^(ab) mod p yields S_(S). This is standard in the cyber security field.

Unbreakable Primitive

Given a message M, distribute the numerical content of M over a multivector M. For example, let M be represented as below:

M=m₁, m₂, m₃ . . . m_(n)

such that m_(i) is a number that constitutes a placed integer value for a coefficient, Then:

M=m ₀ +m ₁ ē ₁ +m ₂ ē ₂ +m ₃ ē ₃ +m ₄ ē ₁₂ +m ₆ ē ₂₃ +m ₇ ē ₁₂₃

Note that other multivector variations are also possible.

The shared secret S_(S) is changed to a multivector in the same or a similar manner, such as:

S _(S) =s ₁₁ , s ₁₂ , s ₁₃ . . . s_(1n)

S _(S) =s ₁₀ +s ₁₁ ē ₁ +s ₁₂ ē ₂ +s ₁₃ ē ₃ +s ₁₄ ē ₁₂ +s ₁₅ ē ₁₃ +s ₁₆ ē ₂₃ +s ₁₇ ē ₁₂₃

An operation known as “0-Blade Reduction” creates a new scalar from S _(S) as a second shared secret S_(S) ₂ , where:

S _(S) ₂ =( S _(S) S _(S))( S _(S) S _(S))^(†)=scalar

Then S_(S) ₂ is converted to a multivector, for example:

S _(S) ₂ =s ₂₀ +s ₂₁ ē ₁ +s ₂₂ ē ₂ +s ₂₃ ē ₃ +s ₂₄ ē ₁₂ +s ₂₅ ē ₁₃ +s ₂₆ ē ₂₃ +s ₂₇ ē ₁₂₃

Finally, the multivector-based Sylvester's equation may be used to create a cipher. Thus, the cryptotext multivector C is:

C=S _(S) M+M S _(S) ₂

because S_(S) ₂ is a result of a one-way function and S_(S) is a shared secret, which, when operated on by the 0-Blade Reduction Operation (which may sometimes be referenced herein as the function Z_(V)( )) becomes a new result embedding a new one-way function.

Up to this point the encryption may have susceptibility to a pair of known cryptotext attacks, However, as shown in part below, the final unbreakability has been achieved.

Encryption Primitives With Unbreakable Cipher:

Primitive 1—“Sandwich”/Triple Product

Encryption

The first encryption primitive may be created through a sequence of geometric products using the pair of keys generated via the 0-Blade Reduction Operation (described above) as follows:

In order to add another layer of security to the cipher text C and guarantee unbreakability against standard cipher analysis, such as the known plain-text attack, it may be helpful to do the following.:

-   -   The cipher text, originally in multivector form, is converted to         a number C′

$\overset{\_}{C}\overset{{multivector}\mspace{14mu} {to}\mspace{14mu} {number}}{}C^{\prime}$

-   -   yielding a ‘pre-cipher’ which is denoted here as C′,     -   Then ‘mask’ this pre-cipher C′ by performing an XOR operation         with the shared secret S_(S)

C=C′XOR S _(S)

to obtain the final cipher/crypto text C, which is sent to a destination computing device.

Decryption

The decryption process may comprise the following steps:

-   -   Receive the cryptotext C at the destination computing device.     -   Recover the pre-cipher cryptotext C′ from the cryptotext C using         the shared secret S_(S), as follows:

C′=C XOR S_(S)

-   -   Convert C′ into a multivector yielding the cryptotext         multivector C:

$C^{\prime}\overset{{multivector}\; \_ \; {to}\; \_ \; {number}}{}\overset{\_}{C}$

-   -   Recover the message multivector M making use of the inverse         multivectors with respect to S _(S) and S _(S) ₂

M=S _(S) ⁻¹ C S _(S) ₂ ⁻¹

Primitive 2—Multivector-Based Sylvester's Equation

Encryption

The multivector based Sylvester's equation may be employed here to generate a second encryption primitive which also uses the pair of symmetric shared secret keys generated via the 0-Blade Reduction Operation (described above), as follows:

C=S _(S) M+M S _(S) ₂

As was done above for the encryption primitive with “sandwich”/triple product, it may be beneficial to add another layer of security by using the same process as described above for XOR masking.

The cipher multivector C, which is a result of the multivector based Sylvester's equation above, is converted into a number, denoted by C′ and defined as a pre-cipher. This number is the information to be sent from the source computing device to the destination computing device.

Decryption

The decryption operation involves the closed-form solution of the multivector based Sylvester's equation for 3-dimensional multivector space and the XOR ‘unmask’ previously described for the “sandwich”/triple product above. The summarized processes are given below:

-   -   Receive the cryptotext C as a number.     -   Recover the pre-cipher cryptotext C″ from cryptotext C using the         shared secret S_(S):

C′=C XOR S_(S)

-   -   Distribute C′ into the coefficients of a cryptotext multivector

$C^{\prime}\overset{{multivector}\mspace{14mu} {to}\mspace{14mu} {number}}{}\overset{\_}{C}$

-   -   The message multivector is recovered using the following         closed-form solution for the multivector based Sylvester's         equation:

M =( S _(S) ₂ + S _(s) ₂ + S _(S) ⁻¹ S _(S) ₂ S_(S) ₂ +S _(S))⁻¹( S _(S) ⁻¹ C S_(S) ₂ +C)

Note that a solution for higher dimensions requires a different formula. Further note that if the original shared secret (S_(S)) is generated using an encrypted/secure key exchange, such as, but not limited to the Diffie-Hellman process discussed in more detail herein, there is no transmission of the original shared secret multivector (S _(S)) and, consequently, no transmission of the second shared secret multivector (S _(S) ₂ ). Still further note that since the second shared secret multivector (S _(S) ₂ ) is a result of a one-way function, the use of the second shared secret multivector (S _(S) ₂ ) in either of the Geometric Algebra encryption primitive operations above, further guarantees security. Ultimately, as best as can be ascertained, there is no feasible way or high computer power to find S_(S), S_(S) ₂ or sequences of such, which can be also dynamically updated in a continuous fashion using other Geometric Algebra operations to further increase security.

APPENDIX A: GEOMETRIC ALGEBRA OVERVIEW

Geometric Algebra combines the work of Hamilton (Quartenion) and Grassman (Non-Commutative Algebra) into a field that generalizes the product of two vectors, including the 3-dimensionally restricted “Cross Product” to an n-dimensional subspace of the vector space (V) over number fields (

,

,

,

, etc.) such that the subspace is a product space that allows two vectors to have a “geometric product” as:

A B = A · B + A

B

Where Ā and B are vectors or multivectors (i.e.: a collection of “blades” as defined below). The operation Ā

B is known as a “wedge product” or “exterior product,” The operation Ā·B is the “dot product” or “interior product” (aka. “inner product”).

For a simple pair of two dimensional vectors:

Ā=a ₁ ē ₁ +a ₂ ē ₂

B=b ₁ ē ₁ +b ₂ ē ₂

where the set {ē₁, ē₂} are unit basis vectors and {a_(i)}, {b_(i)}, i=1,2 are scalars, the geometric product follows the rules of Geometric Algebra, as described below:

ē _(i)

ē _(i)=0

ē _(i)

ē _(j) =−ē _(j)

ē _(i)

ē _(i)

ē _(j) =ē _(ij) (compact notation)

ē _(i) ·ē _(i)=1

ē _(i) ·ē _(j)=0

Thus, by performing the geometric product of Ā and B we have:

$\overset{\_}{AB} = {\underset{\underset{{dot}\mspace{14mu} {product}}{}}{\left\lbrack {{\left( {a_{1}b_{1}} \right)\overset{\overset{{{\overset{\_}{e}}_{i} \cdot {\overset{\_}{e}}_{i}} = 1}{}}{{\overset{\_}{e}}_{1} \cdot {\overset{\_}{e}}_{1}}} + {\left( {a_{1}b_{2}} \right)\overset{\overset{{{\overset{\_}{e}}_{i} \cdot {\overset{\_}{e}}_{j}} = 0}{}}{{\overset{\_}{e}}_{1} \cdot {\overset{\_}{e}}_{2}}} + {\left( {a_{2}b_{1}} \right)\overset{\overset{{{\overset{\_}{e}}_{j} \cdot {\overset{\_}{e}}_{i}} = 0}{}}{{\overset{\_}{e}}_{2} \cdot {\overset{\_}{e}}_{1}}} + {\left( {a_{2}b_{2}} \right)\overset{\overset{{{\overset{\_}{e}}_{i} \cdot {\overset{\_}{e}}_{j}} = 1}{}}{{\overset{\_}{e}}_{2} \cdot {\overset{\_}{e}}_{2}}}} \right\rbrack} + \underset{\underset{{wedge}\mspace{14mu} {product}}{}}{\left\lbrack {{\left( {a_{1}b_{1}} \right)\overset{\overset{{{\overset{\_}{e}}_{i}\bigwedge{\overset{\_}{e}}_{i}} = 0}{}}{{\overset{\_}{e}}_{1}\bigwedge{\overset{\_}{e}}_{1}}} + {\left( {a_{1}b_{2}} \right){{\overset{\_}{e}}_{1}\bigwedge{\overset{\_}{e}}_{2}}} + {\left( {a_{2}b_{1}} \right)\overset{\overset{{{\overset{\_}{e}}_{j}\bigwedge{\overset{\_}{e}}_{i}} = {{- {\overset{\_}{e}}_{i}}\bigwedge{\overset{\_}{e}}_{j}}}{}}{{\overset{\_}{e}}_{2}\bigwedge{\overset{\_}{e}}_{1}}} + {\left( {a_{2}b_{2}} \right)\overset{\overset{{{\overset{\_}{e}}_{i}\bigwedge{\overset{\_}{e}}_{j}} = 0}{}}{{\overset{\_}{e}}_{2}\bigwedge{\overset{\_}{e}}_{2}}}} \right\rbrack}}$

Resulting in:

ĀB =(a ₁ b ₁ +a ₂ b ₂)+(a ₁ b ₂ −b ₁ a ₂)ē ₁

ē ₂

The product ĀB produces a scalar and an object ē₁

ē ₂ which in compact notation is written as ē₁₂ and represents an area created by ē₁

ē₂ clockwise rotation or −ē₂

ē₁ in anti-clockwise. The orientation is given by the sign of the term in front of the ē₁

ē₂ component.

As an example, let

Ā=−2ē ₁+4ē ₂

B=3ē ₁+5ē ₂

Using the rules of Geometric Algebra described above we can compute the geometric product between Ā and B as:

${\overset{\_}{A}\mspace{11mu} \overset{\_}{B}} = {\underset{\underset{{dot}\mspace{14mu} {product}}{}}{\left\lbrack {{\left( {{- 2} \times 3} \right){{\overset{\_}{e}}_{1} \cdot {\overset{\_}{e}}_{1}}} + {\left( {{- 2} \times 5} \right){{\overset{\_}{e}}_{1} \cdot {\overset{\_}{e}}_{2}}} + {\left( {4 \times 3} \right){{\overset{\_}{e}}_{2} \cdot {\overset{\_}{e}}_{1}}} + {\left( {4 \times 5} \right){{\overset{\_}{e}}_{2} \cdot {\overset{\_}{e}}_{2}}}} \right\rbrack} + \underset{\underset{{wedge}\mspace{14mu} {product}}{}}{\left\lbrack {{\left( {{- 2} \times 3} \right){{\overset{\_}{e}}_{1}\bigwedge{\overset{\_}{e}}_{1}}} + {\left( {{- 2} \times 5} \right){{\overset{\_}{e}}_{1}\bigwedge{\overset{\_}{e}}_{2}}} + {\left( {4 \times 3} \right){{\overset{\_}{e}}_{2}\bigwedge{\overset{\_}{e}}_{1}}} + {\left( {4 \times 5} \right){{\overset{\_}{e}}_{2}\bigwedge{\overset{\_}{e}}_{2}}}} \right\rbrack}}$ $\mspace{20mu} {{\overset{\_}{A}\mspace{11mu} \overset{\_}{B}} = {\left( {{- 6} + 20} \right) + \left( {{{- 10}{{\overset{\_}{e}}_{1}\bigwedge{\overset{\_}{e}}_{2}}} + {12{{\overset{\_}{e}}_{2}\bigwedge{\overset{\_}{e}}_{1}}}} \right)}}$ $\mspace{20mu} {{\overset{\_}{A}\mspace{11mu} \overset{\_}{B}} = {(14) + \left( {{{- 10}{{\overset{\_}{e}}_{1}\bigwedge{\overset{\_}{e}}_{2}}} - {12{{\overset{\_}{e}}_{1}\bigwedge{\overset{\_}{e}}_{2}}}} \right)}}$ $\mspace{20mu} {{\overset{\_}{A}\mspace{11mu} \overset{\_}{B}} = {(14) + \left( {{- 22}{{\overset{\_}{e}}_{1}\bigwedge{\overset{\_}{e}}_{2}}} \right)}}$ $\mspace{20mu} {{\overset{\_}{A}\mspace{11mu} \overset{\_}{B}} = {14 - {22{\overset{\_}{e}}_{12}}}}$

Another way of computing the geometric product between multivectors combines the rules of the dot and the wedge products shown above, where we define the following rules when expanding a general geometric product:

ē _(i) ē _(i)=1

ē _(i) ē _(j) =−ē _(j) ē _(i)

ē _(i) ē _(j) =ē _(ij) (compact notation)

This method is used for computer coding in order to speed up the computation of the geometric product. Using the same multivectors of the previous example and these rules, the geometric product between Ā and B is calculated as:

${\overset{\_}{A}\mspace{11mu} \overset{\_}{B}} = {{\left( {{- 2} \times 3} \right)\overset{\overset{{{\overset{\_}{e}}_{i}{\overset{\_}{e}}_{i}} = 1}{}}{{\overset{\_}{e}}_{1}{\overset{\_}{e}}_{1}}} + {\left( {{- 2} \times 5} \right){\overset{\_}{e}}_{1}{\overset{\_}{e}}_{2}} + {\left( {4 \times 3} \right){\overset{\_}{e}}_{2}{\overset{\_}{e}}_{1}} + {\left( {4 \times 5} \right)\overset{\overset{{{\overset{\_}{e}}_{j}{\overset{\_}{e}}_{j}} = 1}{}}{{\overset{\_}{e}}_{2}{\overset{\_}{e}}_{2}}}}$ ${\overset{\_}{A}\mspace{11mu} \overset{\_}{B}} = {{- 6} - {10{\overset{\_}{e}}_{1}{\overset{\_}{e}}_{2}} + {12\overset{\overset{{{\overset{\_}{e}}_{j}{\overset{\_}{e}}_{i}} = {{- {\overset{\_}{e}}_{i}}{\overset{\_}{e}}_{j}}}{}}{{\overset{\_}{e}}_{2}{\overset{\_}{e}}_{1}}} + 20}$ ${\overset{\_}{A}\mspace{11mu} \overset{\_}{B}} = {14 - {10{\overset{\_}{e}}_{1}{\overset{\_}{e}}_{2}} + {12{\overset{\_}{e}}_{1}{\overset{\_}{e}}_{2}}}$ ${\overset{\_}{A}\mspace{11mu} \overset{\_}{B}} = {{14 - {22\; \overset{\overset{{{\overset{\_}{e}}_{i}{\overset{\_}{e}}_{j}} = {\overset{\_}{e}}_{ij}}{}}{{\overset{\_}{e}}_{1}{\overset{\_}{e}}_{2}}}} = {14 - {22{\overset{\_}{e}}_{12}}}}$

Definition of Multivectors and Blades

Another way of describing the objects (or elements) that form a multivector is to use the definition of “blade”, or a k-blade. In this convention at k=0, we have a scalar, at k=1 a vector, k=2 a bivector, and so on,

A multivector is then formed by:

C =

C

₀ +

C

₁ +

C

₂ + . . . +

C

₂

where n is the dimension of the multivector.

As was shown in the previous example, the Geometric Product of two 1-blade multivectors yields a 0-blade plus 2-blade multivector as a result:

$\overset{\_}{C} = {{\overset{\_}{A}\mspace{11mu} \overset{\_}{B}} = {\underset{\underset{scalar}{}}{14} - \underset{\underset{{bi}\text{-}{vector}}{}}{22{\overset{\_}{e}}_{12}}}}$

Note that if one wishes to multiply a scalar t by a multivector C this would follow a distributive principle giving

t C =t

C

₀ +t

C

₁ +t

C

₂ + . . . t

C

_(n)

For the particular example above one would have:

t C =t(14−22 e ₁₂)=t14−t22 e ₁₂

The dimensionality of a vector or k-blades in general is not restricted or a function of k. For example, we could easily demonstrate the example above with 3-D, 4-D or n-D vectors, such as Ā=a₁ē₁+a₂ē₂+a₃ē₃+ . . . +a_(n)ē_(n), which would yield “hypercubes” as elements of the blades created from the wedge product part of the resulting multivectors.

Multivector Operations

Embodiments may rely in part upon the unique characteristics of Geometric Algebra multivector operations. Key among these operations is:

A A ⁻¹=1

Where Ā⁻¹ is the inverse of Ā. There are several important multivector operations that are applied to determine k-blade multivector inversions:

-   -   (1) Space inversion, written as Ā*, changes in the orientation         of the basis vector as ē_(k)→−ē_(k) yielding the following         general blade representation:

A *=

Aμ ₀ −

A

₁ +

A

₂+ . . . +(−1)^(n)

A

_(n)

-   -   (2) Reverse, written as Ā^(†), reverses the order of all         products such that ē₁ē₂ . . . ē_(n-1)ē_(n)→ē_(n)ē_(n-1) . . .         ē₂ē₁. Note that the order of a scalar or a vector cannot be         reversed because it is impossible to reverse the order of one or         no things. From the rules of Geometric Algebra above we have         ē_(i)ē_(j)=−ē_(j)ē_(i), for example. A general blade         representation is written as:

A ^(†) =

A

₀ +

A

₁ −

A

₂+ . . . +(−1)^(n/2)

A

_(n)

-   -   (3) Clifford conjugation, written as Ā, combines the space         inversion and the reverse. The general blade representation that         defines the Clifford conjugation is written as

A =

A

₀ −

A

₁ −

A

₂+ . . . +(−1)^(n+(n/2))

A

_(n)

The norm of a multivector Ā is defined as

∥ A ∥=

A A ^(†)

₀ ^(1/2)

where the operator

₀ pick only the elements of the 0-blade of the resulting vector of the geometric product between Ā and its reverse. It is also the result of the dot product between Ā and its reverse, As an example, define the 2 dimension multivector

A =a ₀ +a ₁ e ₁ +a ₂ e ₂ +a ₁₂ e ₁₂

The reverse of Ā is:

A ^(†) =a ₀ +a ₁ e ₁ +a ₂ e ₂ −a ₁₂ e ₁₂

The norm of Ā is computed from:

${\overset{\_}{A}\mspace{11mu} {\overset{\_}{A}}^{\dagger}} = {{a_{0}a_{0}} + {a_{0}a_{1}{\overset{\_}{e}}_{1}} + {a_{0}a_{2}{\overset{\_}{e}}_{2}} - {a_{0\;}a_{12}{\overset{\_}{e}}_{12}} + {a_{1}a_{0}{\overset{\_}{e}}_{1}} + {a_{1}a_{1}\overset{\overset{= 1}{}}{{\overset{\_}{e}}_{1}{\overset{\_}{e}}_{1}}} + {a_{1}a_{2}\overset{\overset{= {\overset{\_}{e}}_{12}}{}}{{\overset{\_}{e}}_{1}{\overset{\_}{e}}_{2}}} - {a_{1}a_{12}\overset{\overset{= {{{\overset{\_}{e}}_{1}{\overset{\_}{e}}_{1}{\overset{\_}{e}}_{2}} = {\overset{\_}{e}}_{2}}}{}}{{\overset{\_}{e}}_{1}{\overset{\_}{e}}_{12}}} + {a_{2}a_{0}{\overset{\_}{e}}_{2}} + {a_{2}a_{1}\overset{\overset{= {- {\overset{\_}{e}}_{12}}}{}}{{\overset{\_}{e}}_{2}{\overset{\_}{e}}_{1}}} + {a_{2}a_{2}\overset{\overset{= 1}{}}{{\overset{\_}{e}}_{2}{\overset{\_}{e}}_{2}}} - {a_{2}a_{12}\overset{\overset{= {{{\overset{\_}{e}}_{2}{\overset{\_}{e}}_{1}{\overset{\_}{e}}_{2}} = {{{- {\overset{\_}{e}}_{2}}{\overset{\_}{e}}_{2}{\overset{\_}{e}}_{1}} = {- {\overset{\_}{e}}_{1}}}}}{}}{{\overset{\_}{e}}_{2}{\overset{\_}{e}}_{12}}} + {a_{12}a_{0}{\overset{\_}{e}}_{12}} + {a_{12}a_{1}\overset{\overset{= {{{\overset{\_}{e}}_{1}{\overset{\_}{e}}_{2}{\overset{\_}{e}}_{1}} = {{{- {\overset{\_}{e}}_{1}}{\overset{\_}{e}}_{1}{\overset{\_}{e}}_{2}} = {- {\overset{\_}{e}}_{2}}}}}{}}{{\overset{\_}{e}}_{12}{\overset{\_}{e}}_{1}}} + {a_{12}a_{2}\overset{\overset{= {{{\overset{\_}{e}}_{1}{\overset{\_}{e}}_{2}{\overset{\_}{e}}_{2}} = {\overset{\_}{e}}_{1}}}{}}{{\overset{\_}{e}}_{12}{\overset{\_}{e}}_{1}}} - {a_{12}a_{12}\overset{\overset{= {{{\overset{\_}{e}}_{1}{\overset{\_}{e}}_{2}{\overset{\_}{e}}_{1}{\overset{\_}{e}}_{2}} = {{{- {\overset{\_}{e}}_{1}}{\overset{\_}{e}}_{2}{\overset{\_}{e}}_{2}{\overset{\_}{e}}_{1}} = {{{- {\overset{\_}{e}}_{1}}{\overset{\_}{e}}_{1}} = {- 1}}}}}{}}{{\overset{\_}{e}}_{12}{\overset{\_}{e}}_{12}}}}$ ${\overset{\_}{A}\mspace{11mu} {\overset{\_}{A}}^{\dagger}} = {\underset{\underset{{({\overset{\_}{A}\mspace{11mu} {\overset{\_}{A}}^{\dagger}})}_{0}}{}}{\left( {a_{1}^{2} + a_{2}^{2} + a_{3}^{2} + a_{12}^{2}} \right)} + {\left( {{a_{0}a_{1}} + {a_{1}a_{0}} + {a_{2}a_{12}} + {a_{12}a_{2}}} \right){\overset{\_}{e}}_{1}} + {\left( {{a_{0}a_{2}} + {a_{2}a_{0}} - {a_{1}a_{12}} - {a_{12}a_{1}}} \right){\overset{\_}{e}}_{2}} + {\left( {{a_{0}a_{12}} + {a_{12}a_{0}} + {a_{1}a_{2}} - {a_{2}a_{1}}} \right){\overset{\_}{e}}_{12}}}$

Thus,

∥ A =

ĀĀ ^(†)

₀ ^(1/2)=√{square root over (a₀ ² +a ₁ ² +a ₂ ² +a ₁₂ ²)}

The amplitude of a 2-blade or 3-blade multivector is computed as:

|Ā=(ĀA )^(1/2)

As an example consider a 2-blade multivector:

Ā=2+5ē ₁+3ē ₂+8ē ₁₂

The Clifford conjugation of Ā is defined as:

A =2−5ē ₁−3ē ₂−8ē ₁₂

The amplitude of Ā can be found by first computing the geometric product ĀA:

${\overset{\_}{A}\; \overset{\overset{\_}{\_}}{A}} = {{\left( {2 \times 2} \right) + {\left( {2 \times \left( {- 5} \right)} \right){\overset{\_}{e}}_{1}} + {\left( {2 \times \left( {- 3} \right)} \right){\overset{\_}{e}}_{2}} + {\left( {2 \times \left( {- 8} \right)} \right){\overset{\_}{e}}_{12}} + {\left( {5 \times 2} \right){\overset{\_}{e}}_{1}} + {\left( {5 \times \left( {- 5} \right)} \right)\overset{\overset{= 1}{}}{{\overset{\_}{e}}_{1}{\overset{\_}{e}}_{1}}} + {\left( {5 \times \left( {- 3} \right)} \right)\overset{\overset{= {\overset{\_}{e}}_{12}}{}}{{\overset{\_}{e}}_{1}{\overset{\_}{e}}_{2}}} + {\left( {5 \times \left( {- 8} \right)} \right)\overset{\overset{= {{{\overset{\_}{e}}_{1}{\overset{\_}{e}}_{1}{\overset{\_}{e}}_{2}} = {\overset{\_}{e}}_{2}}}{}}{{\overset{\_}{e}}_{1}{\overset{\_}{e}}_{12}}} + {\left( {3 \times 2} \right){\overset{\_}{e}}_{2}} + {\left( {3 \times \left( {- 5} \right)} \right)\overset{\overset{= {- {\overset{\_}{e}}_{12}}}{}}{{\overset{\_}{e}}_{2}{\overset{\_}{e}}_{1}}} + {\left( {3 \times \left( {- 3} \right)} \right)\overset{\overset{= 1}{}}{{\overset{\_}{e}}_{2}{\overset{\_}{e}}_{2}}} + {\left( {3 \times \left( {- 8} \right)} \right)\overset{\overset{= {{{\overset{\_}{e}}_{2}{\overset{\_}{e}}_{1}{\overset{\_}{e}}_{2}} = {{{- {\overset{\_}{e}}_{2}}{\overset{\_}{e}}_{2}{\overset{\_}{e}}_{1}} = {- {\overset{\_}{e}}_{1}}}}}{}}{{\overset{\_}{e}}_{2}{\overset{\_}{e}}_{12}}} + {\left( {8 \times 2} \right){\overset{\_}{e}}_{12}} + {\left( {8 \times \left( {- 5} \right)} \right)\overset{\overset{= {{{\overset{\_}{e}}_{1}{\overset{\_}{e}}_{2}{\overset{\_}{e}}_{1}} = {{{- {\overset{\_}{e}}_{1}}{\overset{\_}{e}}_{1}{\overset{\_}{e}}_{2}} = {- {\overset{\_}{e}}_{2}}}}}{}}{{\overset{\_}{e}}_{12}{\overset{\_}{e}}_{1}}} + {\left( {8 \times \left( {- 3} \right)} \right)\overset{\overset{= {{{\overset{\_}{e}}_{1}{\overset{\_}{e}}_{2}{\overset{\_}{e}}_{2}} = {\overset{\_}{e}}_{1}}}{}}{{\overset{\_}{e}}_{12}{\overset{\_}{e}}_{2}}\left( {8 \times \left( {- 8} \right)} \right)\overset{\overset{= {{{\overset{\_}{e}}_{1}{\overset{\_}{e}}_{2}{\overset{\_}{e}}_{1}{\overset{\_}{e}}_{2}} = {{{- {\overset{\_}{e}}_{1}}{\overset{\_}{e}}_{2}{\overset{\_}{e}}_{2}{\overset{\_}{e}}_{1}} = {{{- {\overset{\_}{e}}_{1}}{\overset{\_}{e}}_{1}} = {- 1}}}}}{}}{{\overset{\_}{e}}_{12}{\overset{\_}{e}}_{12}}\overset{\_}{A}\; \overset{\overset{\_}{\_}}{A}}} = {{\left( {4 - 25 - 9 + 64} \right) + {\left( {{- 10} + 10 + 24 - 24} \right){\overset{\_}{e}}_{1}} + {\left( {{- 6} - 40 + 6 + 40} \right){\overset{\_}{e}}_{2}} + {\left( {{- 16} - 15 + 15 + 16} \right){\overset{\_}{e}}_{12}\overset{\_}{A}\; \overset{\overset{\_}{\_}}{A}}} = 34}}$

Hence,

|Ā|=(ĀA )^(1/2)=√{square root over (34)}

Multivector inversion is defined as:

${\overset{\_}{A}}^{- 1} = \frac{\overset{\overset{\_}{\_}}{A}}{{\overset{\_}{A}}^{2}}$

This gives:

${\overset{\_}{A}\; {\overset{\_}{A}}^{- 1}} = {\frac{\overset{\_}{A}\; \overset{\overset{\_}{\_}}{A}}{{\overset{\_}{A}}^{2}} = {\frac{{\overset{\_}{A}}^{2}}{{\overset{\_}{A}}^{2}} = 1}}$

As an example consider again the multivector Ā=2+5ē₁+3ē₂+8ē₁₂ has its inverse computed as:

${\overset{\_}{A}}^{- 1} = {\frac{\overset{\overset{\_}{\_}}{A}}{{\overset{\_}{A}}^{2}} = \frac{2 - {5\; {\overset{\_}{e}}_{1}} - {3\; {\overset{\_}{e}}_{2}} - {8\; {\overset{\_}{e}}_{12}}}{34}}$

Hence,

$\mspace{20mu} {{\overset{\_}{A}\; {\overset{\_}{A}}^{- 1}} = {2 + {5\; {\overset{\_}{e}}_{1}} + {3\; {\overset{\_}{e}}_{2}} + {8\; {\overset{\_}{e}}_{12}\frac{2 - {5\; {\overset{\_}{e}}_{1}} - {3\; {\overset{\_}{e}}_{2}} - {8\; {\overset{\_}{e}}_{12}}}{34}}}}$ ${\overset{\_}{A}\; {\overset{\_}{A}}^{- 1}} = {\frac{1}{34} \times \left( {4 - {10\; {\overset{\_}{e}}_{1}} - {6\; {\overset{\_}{e}}_{2}} - {16\; {\overset{\_}{e}}_{12}} + {10\; {\overset{\_}{e}}_{1}} - {25\; {\overset{\_}{e}}_{1}{\overset{\_}{e}}_{1}} - {15\; {\overset{\_}{e}}_{1}{\overset{\_}{e}}_{2}} - {40\; {\overset{\_}{e}}_{1}{\overset{\_}{e}}_{12}} + {6\; {\overset{\_}{e}}_{2}} - {15\; {\overset{\_}{e}}_{2}{\overset{\_}{e}}_{1}} - {9\; {\overset{\_}{e}}_{2}{\overset{\_}{e}}_{2}} - {24\; {\overset{\_}{e}}_{2}{\overset{\_}{e}}_{12}} + {16\; {\overset{\_}{e}}_{12}} - {40\; {\overset{\_}{e}}_{12}{\overset{\_}{e}}_{1}} - {24\; {\overset{\_}{e}}_{12}{\overset{\_}{e}}_{2}} - {64\; {\overset{\_}{e}}_{12}{\overset{\_}{e}}_{12}}} \right)}$ ${\overset{\_}{A}\; {\overset{\_}{A}}^{- 1}} = {\frac{1}{34} \times \left( {4 - {10\; {\overset{\_}{e}}_{1}} - {6\; {\overset{\_}{e}}_{2}} - {16\; {\overset{\_}{e}}_{12}} + {10\; {\overset{\_}{e}}_{1}} - {25{\overset{\_}{e}}_{1}} - {15\; {\overset{\_}{e}}_{12}} - {40\; {\overset{\_}{e}}_{2}} + {6\; {\overset{\_}{e}}_{2}} - {15\; {\overset{\_}{e}}_{21}} - 9 + {24\; {\overset{\_}{e}}_{2}{\overset{\_}{e}}_{21}} + {16\; {\overset{\_}{e}}_{12}} + {40\; {\overset{\_}{e}}_{21}{\overset{\_}{e}}_{1}} - {24\; {\overset{\_}{e}}_{1}} + {64\; {\overset{\_}{e}}_{12}{\overset{\_}{e}}_{21}}} \right)}$ ${\overset{\_}{A}\; {\overset{\_}{A}}^{- 1}} = {\frac{1}{34} \times \left( {4 - {10\; {\overset{\_}{e}}_{1}} - {6\; {\overset{\_}{e}}_{2}} - {16\; {\overset{\_}{e}}_{12}} + {10\; {\overset{\_}{e}}_{1}} - {25{\overset{\_}{e}}_{1}} - {15\; {\overset{\_}{e}}_{12}} - {40\; {\overset{\_}{e}}_{2}} + {6\; {\overset{\_}{e}}_{2}} + {15\; {\overset{\_}{e}}_{12}} - 9 + {24{\overset{\_}{e}}_{1}} + {16\; {\overset{\_}{e}}_{12}} + {40\; {\overset{\_}{e}}_{2}} - {24\; {\overset{\_}{e}}_{1}} + 64} \right)}$

${{\overset{\_}{A}\; {\overset{\_}{A}}^{- 1}} = {\frac{34}{34} = 1}},$

which being equal to 1, clearly shows that the inverse is thus proven.

For the special case where the multivector reduces to the sub-algebra of 1-blade, the inverse can be also computed using the reverse through the following relationship:

${\overset{\_}{A}}^{- 1} = \frac{{\overset{\_}{A}}^{\dagger}}{{\overset{\_}{A}}^{2}}$

For example, consider the multivector:

Ā=5ē ₁+3ē ₂+8ē ₃

The reverse in this case is:

Ā ^(†)=5ē ₁+3ē ₂+8ē ₃

which is identical to the original multivector, If we compute the inverse, we have

${\overset{\_}{A}}^{- 1} = {\frac{{\overset{\_}{A}}^{\dagger}}{{\overset{\_}{A}}^{2}} = \frac{{5\; {\overset{\_}{e}}_{1}} - {3\; {\overset{\_}{e}}_{2}} - {8\; {\overset{\_}{e}}_{3}}}{98}}$

Because:

ĀĀ ^(†)=25ē ₁ ē ₁+15ē ₁ ē ₂+40ē ₁ ē ₃+15ē ₂ ē ₁+9ē ₂ ē ₂+24ē ₂ ē ₃+40ē ₃ ē ₁+24ē ₃ ē ₂+64 ē ₃ ē ₃

ĀĀ ^(†)=25+15ē ₁₂−40ē ₃₁−15ē ₁₂+9+24ē ₂₃+40ē ₃₁−24ē ₂₃+64

ĀĀ ^(†)=99

thus if we compute ĀĀ⁻¹ we obtain:

${\overset{\_}{A\; A}}^{- 1} = {{\left( {{5\; {\overset{\_}{e}}_{1}} - {3\; {\overset{\_}{e}}_{2}} - {8\; {\overset{\_}{e}}_{3}}} \right)\frac{{5\; {\overset{\_}{e}}_{1}} - {3\; {\overset{\_}{e}}_{2}} - {8\; {\overset{\_}{e}}_{3}}}{98}} = {\frac{98}{98} = 1}}$

For application purposes we wish to have a single formula to compute the inverse and we choose the first option, which uses the Clifford conjugation operation. However, when computing the inverse of a given multivector that is reduced to the even sub-algebra it is possible to obtain a complex-like number from the geometric product between ĀĀ. A common operation in complex number theory is the process of ‘rationalizing the denominator’ for a complex number in the form

$\frac{1}{x + {iy}}$

by multiplying top and bottom by the complex conjugate x−iy which produces a single real valued denominator

$\frac{x - {iy}}{x^{2} + y^{2}}.$

This process can be duplicated for a multivector where now the reverse operation (†) will play the role of the complex conjugate. This allows us to rewrite the inverse equation for a multivector as follows:

${\overset{\_}{A}}^{- 1} = {\frac{\overset{\overset{\_}{\_}}{A}}{{\overset{\_}{A}}^{2}} = \frac{{\overset{\overset{\_}{\_}}{A}\left( {\overset{\_}{A}\; \overset{\overset{\_}{\_}}{A}} \right)}^{\dagger}}{\left( {\overset{\_}{A}\; \overset{\overset{\_}{\_}}{A}} \right)\left( {\overset{\_}{A}\; \overset{\overset{\_}{\_}}{A}} \right)^{\dagger}}}$

As an example of the use of this general formula let:

Ā=2+3ē ₁+4ē ₂+6ē ₃+7ē ₁₂+8ē ₂₃+9ē ₃₁+10ē ₁₂₃

Its Clifford conjugation is given by:

A =2−3ē ₁−4ē ₂−6ē ₃−7ē ₁₂−8ē ₂₃−9ē ₃₁+10ē ₁₂₃

Using the properties of geometric product described earlier we compute ĀA to obtain:

ĀA=37−34ē ₁₂₃

Using the original inverse formula defined by the Clifford conjugation we would have

${\overset{\_}{A}}^{- 1} = {\frac{\overset{\overset{\_}{\_}}{A}}{{\overset{\_}{A}}^{2}} = \frac{2 - {3\; {\overset{\_}{e}}_{1}} - {4\; {\overset{\_}{e}}_{2}} - {6\; {\overset{\_}{e}}_{3}} - {7\; {\overset{\_}{e}}_{12}} - {8\; {\overset{\_}{e}}_{23}} - {9\; {\overset{\_}{e}}_{31}} + {10\; {\overset{\_}{e}}_{123}}}{37 - {34\; {\overset{\_}{e}}_{123}}}}$

This result is clearly a complex-like number, since (ē₁₂₃)²=i²=(√{square root over (−1)})²=−1. We rationalize the denominator by performing a geometric product on top and bottom with its reverse (ĀA)^(†)=37+34ē₁₂₃ resulting the Mowing:

$\mspace{20mu} {{\overset{\_}{A}}^{- 1} = {\frac{\overset{\overset{\_}{\_}}{A}}{{\overset{\_}{A}}^{2}} = {\frac{\overset{\overset{\_}{\_}}{A}}{\overset{\_}{A}\; \overset{\overset{\_}{\_}}{A}}\frac{{\overset{\overset{\_}{\_}}{A}\left( {\overset{\_}{A}\; \overset{\overset{\_}{\_}}{A}} \right)}^{\dagger}}{\left( {\overset{\_}{A}\; \overset{\overset{\_}{\_}}{A}} \right)\left( {\overset{\_}{A}\; \overset{\overset{\_}{\_}}{A}} \right)^{\dagger}}}}}$ ${\overset{\_}{A}}^{- 1} = \frac{\left( {2 - {3\; {\overset{\_}{e}}_{1}} - {4\; {\overset{\_}{e}}_{2}} - {6\; {\overset{\_}{e}}_{3}} - {7\; {\overset{\_}{e}}_{12}} - {8\; {\overset{\_}{e}}_{23}} - {9\; {\overset{\_}{e}}_{31}} + {10\; {\overset{\_}{e}}_{123}}} \right)\left( {37 + {34{\overset{\_}{e}}_{123}}} \right)}{\left( {37 - {34\; {\overset{\_}{e}}_{123}}} \right)\left( {37 + {34{\overset{\_}{e}}_{123}}} \right)}$ $\mspace{20mu} {{\overset{\_}{A}}^{- 1} = \frac{\begin{matrix} {{- 266} + {195\; {\overset{\_}{e}}_{1}} - {420\; {\overset{\_}{e}}_{2}} + {16\; {\overset{\_}{e}}_{3}} - {463\; {\overset{\_}{e}}_{12}} -} \\ {{160\; {\overset{\_}{e}}_{23}} - {435\; {\overset{\_}{e}}_{31}} + {438\; {\overset{\_}{e}}_{123}}} \end{matrix}}{2525}}$

The use of multivector inverses is important to the various embodiments. The algorithms in Geometric. Algebra used to compute inverses vary according to the space dimension n of the multivector. This overview of Geometric Algebra is not intended to be exhaustive, only sufficient for the discussion of the embodiment features and the examples herein presented. For a more exhaustive reference see [REFERENCE1].

The use of Sylvester's Equation in Sign, Seal, Delivered Messaging

In the method of “signing and sealing” cryptotext we make use of a well-known matrix equation in the field of mathematics called the Sylvester's equation [REFERENCE2], which is given by

C=AX+XB

By knowing the matrices A, B, and C it is possible to calculate a unique solution for the matrix X. For our purposes, we use the analogous definition of the Sylvester's equation for multivectors as shown in [REFERENCE1]

Y=ĀM+M B

which is obtained when defining a linear function over multivectors in the form of:

${F(M)} = {\sum\limits_{m = 1}^{n}{{\overset{\_}{R}}_{m}\overset{\_}{M}\; {\overset{\_}{S}}_{m}}}$

Here the elements of the Sylvester's equation are defined as:

-   -   C=M=Cryptotext     -   S _(A)=Ā=Source's signature     -   S _(B)=B=Destination's signature     -   P=Y“Package” to be sent

A solution analogous to the results using quartenions or matrices in [REFERENCE2] is given in [REFERENCE1] as:

M =( B+B+Ā ⁻¹ B B+Ā)⁻¹(Ā ⁻¹ Y B+Y )

and is used by the destination to unpack the cryptotext prior to the decryption process.

[REFERENCE1] “Functions of Multivector Variables,” PLOS ONE| DOI:10.1371/journal.pone.0116943 Mar. 16, 2015, James M. Chappell, Azhar Iqbal, Lachlan J. Gunn, Derek Abbott, School of Electrical and Electronic Engineering, University of Adelaide, Adelaide, South Australia, Australia}

[REFERENCE2]Janovska. D, Opfer G (2008) Linear equations in quaternionic variables. Mat Math Ges Hamburg 27:223-234.

The foregoing description of the invention has been presented for purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise form disclosed, and other modifications and variations may be possible in light of the above teachings. The embodiment was chosen and described in order to best explain the principles of the invention and its practical application to thereby enable others skilled in the art to best utilize the invention in various embodiments and various modifications as are suited to the particular use contemplated. It is intended that the appended statements of the invention he construed to include other alternative embodiments of the invention except insofar as limited by the prior art. 

What is claimed is:
 1. A method for the encrypted transfer of numeric message data (M) from a source computing device to a destination computing device, the method comprising: distributing by said source computing device said numeric message data (M) into coefficients of a message multivector (M) in accord with a message data coefficient distribution algorithm that is known to both said source computing device and said destination computing device; distributing by said source computing device a shared secret numeric value (S_(S)) into coefficients of a shared secret multivector (S _(S)) in accord with a shared secret coefficient distribution algorithm that is known to both said source computing device and said destination computing device, said shared secret numeric value (S_(S)) being known or knowable to both said source computing device and said destination computing device but is kept secret from other devices not intended to have access to said numeric message data; encrypting by said. source computing device a cryptotext multivector (C) as a function of at least one Geometric Algebra geometric product operation on said message multivector (M) and said shared secret multivector (S _(S)); sending by said source computing device said cryptotext multivector (C) to said destination computing device; receiving by said destination computing device said cryptotext multivector (C) sent by said source computing device; distributing by said destination computing device said shared secret numeric value (S_(S)) into said shared secret multivector (S _(S)) in accord with said shared secret coefficient distribution algorithm; decrypting by said destination computing device said cryptotext multivector (C) as a function of at least one Geometric Algebra geometric product operation on said cryptotext multivector (C) and an inverse (S _(S) ⁻¹) of said shared secret multivector (S _(S)) back into said message multivector (M); and converting by said destination computing device said message multivector (M) into said message numeric data (M) in accord with reverse operation of said message data coefficient distribution algorithm.
 2. The method of claim 1 wherein evaluation of Geometric Algebra geometric products and inverses of multivectors is implemented on said source computing device and said destination computing device using basic arithmetic operations of addition, subtraction, multiplication, and division.
 3. The method of claim 2 wherein said implementation of said Geometric Algebra geometric products and inverses of multivectors on said source computing device and said destination computing device does not include a complex operation to select a prime number, to calculate a logarithm function, and/or to calculate a natural logarithm function.
 4. The method of claim 1 further comprising: converting by said source computing device an original alphanumeric text message into said numeric message data (M) as a function of standard computer character encoding characteristics; and converting by said destination computing device said numeric message data (M) back into said original alphanumeric text message as a function of said standard computer character encoding characteristics.
 5. The method of claim 4 wherein said standard computer character encoding characteristics are ASCII (American Standard Code for Information Exchange) codes of text characters of said original alphanumeric text message.
 6. The method of claim 1 further comprising establishing said shared secret numeric value (S_(S)) between said source computing device and said destination computing device using a known shared secret technique.
 7. The method of claim 6 wherein said known shared secret technique is comprised of at least one of a group chosen from: pre-conditioning said source computing device and said destination computing device with said shared secret numeric value (S_(S)), standard public/private key exchange technique, RSA (Rivest-Shamir-Adleman) key exchange, and Diffie-Hellman key exchange.
 8. The method of claim 1 wherein said at least one Geometric Algebra geometric product operation is comprised of at least one of a group chosen from: a geometric product (C=M S _(S)) of said message multivector (M) and said shared secret multivector (S _(S)) to encrypt and a geometric product (M=C S _(S) ⁻¹) of said cryptotext multivector (C) and said inverse (S _(S) ⁻¹) of said shared secret multivector (S _(S)) to decrypt; geometric product “sandwich” (C=S _(S) M S _(S) to encrypt and M=S _(S) ⁻¹ C S _(S) ⁻¹ to decrypt); and multivector based Sylvester's equation (C=S _(S) M+M S _(S) to encrypt and M=(S _(S)+S _(S)+S _(S) ⁻¹ S _(S) S _(S)+S _(S))⁻¹(S _(S) ⁻¹ C S _(S)+C) to decrypt).
 9. The method of claim 1 wherein said message multivector (M) and said shared secret multivector (S _(S)) are at least two-dimension multivectors.
 10. The method of claim 9 wherein a dimension size (N) of said message multivector (M) and said shared secret multivector (S _(S)) is at least two-dimensions.
 11. The method of claim 10 wherein a number of coefficients for said message multivector (M) and said shared secret multivector (S _(S)) is increased by a factor of two (2^(N)) for each incremental increase in said dimension size (N).
 12. The method of claim 10 wherein an increase in said dimension size (N) of said message multivector (M) and said shared secret multivector (S _(S)) beyond two-dimension multivectors increases confusion and/or diffusion security characteristics of said encrypted transfer of said numeric message data from said source computing device to said destination computing device.
 13. The method of claim 10 wherein an increase in said dimension size (N) of said message multivector (M) and said shared secret multivector (S _(S)) beyond two-dimension multivectors increases an amount of data capable of being transferred in a single transfer transaction for said message multivector (M) such that additional coefficients in said message multivector (M) hold said increased amount of data capable of being transferred in a single transfer transaction.
 14. The method of claim 10 wherein said dimension size (N) of said message multivector (M) and said shared secret multivector (S _(S)) is greater than two-dimensions and further comprising including additional feature data in said message multivector (M) for each data transfer such that additional coefficients in said message multivector (M) that is greater than two-dimensions hold said additional feature data,
 15. The method of claim 14 wherein said additional feature data is comprised of at least one of a group chosen from: dummy data to increase encryption security, command instructions for additional operations, and configuration data for said additional operations.
 16. The method of claim 1: wherein said process of encrypting by said source computing device said cryptotext multivector (C) as a function of at least one Geometric Algebra geometric product operation on said message multivector (M) and said shared secret multivector (S _(S)) further comprises: generating by said source computing device a second shared secret key (S_(S) ₂ ) as a scalar result of a 0-Blade Reduction Operation of said shared secret multivector (S _(S)); distributing by said source computing device said second shared secret key (S_(S) ₂ ) into coefficients of a second shared secret multivector (S _(S) ₂ ) in accord with a second shared secret coefficient distribution algorithm that is known to both said source computing device and said destination computing device; and encrypting by said source computing device said cryptotext multivector (C) as a function of Geometric Algebra geometric product operations on said message multivector (M), said shared secret multivector (S _(S)), and said second shared secret multivector (S _(S) ₂ ); and wherein said process of decrypting by said destination computing device said cryptotext multivector (C) as a function of at least one Geometric Algebra geometric product operation on said cryptotext multivector (C) and an inverse (S _(S) ⁻¹) of said shared secret multivector (S _(S)) back into said message multivector further comprises (M): generating by said destination computing device said second shared secret key (S_(S) ₂ ) as a scalar result of said 0-Blade Reduction Operation of said shared secret multivector (S _(S)); distributing by said destination computing device said second shared secret key (S_(S) ₂ ) into said second shared secret multivector (S _(S) ₂ ) in accord with said second shared secret coefficient distribution algorithm; and decrypting by said destination computing device said cryptotext multivector (C) as a function of Geometric Algebra geometric product operations on said cryptotext multivector (C), an inverse (S _(S) ⁻¹) of said shared secret multivector (S _(S)), and an inverse (S _(S) ₂ ⁻¹) of said second shared secret multivector (S _(S) ₂ ) back into said message multivector (M).
 17. The method of claim 16 wherein said 0-Blade Reduction Operation is a geometric product (S_(S) ₂ =(S _(S) S _(S))(S _(S) S _(S))^(†)) of a geometric product (S _(S) S _(S)) of said shared secret multivector (S _(S)) and a Clifford conjugate (S _(S)) of said shared secret multivector (S _(S)) and a geometric reverse ((S _(S) S _(S))^(†)) of said geometric product (S _(S) S _(S)) of said shared secret multivector (S _(S)) and said Clifford conjugate (S _(S)) of said shared secret multivector (S _(S)).
 18. The method of claim 16 wherein said Geometric Algebra geometric product operations are comprised of at least one of a group chosen from: geometric product “sandwich” (C=S _(S) M S _(S) ₂ to encrypt and M=S _(S) ⁻¹ C S _(S) ₂ ⁻¹ to decrypt); and multivector based Sylvester's equation (C=S _(S) M+M S _(S) ₂ to encrypt and M=(S _(S) ₂ +S _(S) ₂ +S _(S) ⁻¹ S _(S) ₂ S _(S) ₂ +S _(S))⁻¹(S _(S) ⁻¹ C S _(S) ₂ +C) to decrypt).
 19. The method of claim 1 wherein said processes of sending by said source computing device said cryptotext multivector (C) to said destination computing device and receiving by said destination computing device said cryptotext multivector (C) sent by said source computing device further comprise: converting by said source computing device said cryptotext multivector (C) into cryptotext numeric data (C) in accord with reverse operation of a cryptotext data coefficient distribution algorithm that is known to both said source computing device and said destination computing device; sending by said source computing device said cryptotext numeric data (C) to said destination computing device; receiving by said destination computing device said cryptotext numeric data (C) sent by said source computing device; and distributing by said destination computing device said cryptotext numeric data (C) into said cryptotext multivector (C) in accord with said cryptotext data coefficient distribution algorithm.
 20. The method of claim 19: wherein said process of encrypting by said source computing device said cryptotext multivector (C) as a function of at least one Geometric Algebra geometric product operation on said message multivector (M) and said shared secret multivector (S _(S)) further comprises: generating by said source computing device a second shared secret key (S_(S) ₂ ) as a scalar result of a 0-Blade Reduction Operation of said shared secret multivector (S _(S)); distributing by said source computing device said second shared secret key (S_(S) ₂ ) into coefficients of a second shared secret multivector (S _(S) ₂ ) in accord with a second shared secret coefficient distribution algorithm that is known to both said source computing device and said destination computing device; and encrypting by said source computing device said cryptotext multivector (C) as a function of Geometric Algebra geometric product operations on said message multivector (M), said shared secret multivector (S _(S)), and said second shared secret multivector (S _(S) ₂ ); wherein said process of converting by said source computing device said cryptotext multivector (C) into cryptotext numeric data (C) in accord with reverse operation of said cryptotext data coefficient distribution algorithm that is known to both said source computing device and said destination computing device further comprises: converting by said source computing device said cryptotext multi vector (C) into pre-cipher cryptotext numeric data (C′) in accord with reverse operation of said cryptotext data coefficient distribution algorithm that is known to both said source computing device and said destination computing device; and masking by said source computing device said pre-cipher cryptotext numeric data (C′) by an exclusive or (C=C′XOR S_(S)) with said shared secret numeric value (S_(S)) to obtain said cryptotext numeric data (C); wherein said process of distributing by said destination computing device said cryptotext numeric data (C) into said cryptotext multivector (C) in accord with said cryptotext data coefficient distribution algorithm further comprises: unmasking by said destination computing device said cryptotext numeric data (C) by an exclusive or (C′=C XOR S_(S)) with said shared secret numeric value (S_(S)) to obtain said pre-cipher cryptotext numeric data (C′); and distributing by said destination computing device said pre-cipher cryptotext numeric data (C′) into said cryptotext multivector (C) in accord with said cryptotext data coefficient distribution algorithm; and wherein said process of decrypting by said destination computing device said cryptotext multivector (C) as a function of at least one Geometric. Algebra geometric product operation on said cryptotext multivector (C) and an inverse (S _(S) ⁻¹) of said shared secret multivector (S _(S)) back into said message multivector further comprises (M): generating by said destination computing device said second shared secret key (S_(S) ₂ ) as a scalar result of said 0-Blade Reduction Operation of said shared secret multivector (S _(S)); distributing by said destination computing device said second shared secret key (S_(S) ₂ ) into said second shared secret multivector (S _(S) ₂ ) in accord with said second shared secret coefficient distribution algorithm; and decrypting by said destination computing device said cryptotext multivector (C) as a function of Geometric Algebra geometric product operations on said cryptotext multivector (C), an inverse (S _(S) ⁻¹) of said shared secret multivector (S _(S)), and an inverse (S _(S) ₂ ⁻¹): of said second shared secret multivector (S _(S) ₂ ) back into said message multivector (M).
 21. The method of claim 20 wherein said 0-Blade Reduction Operation is a geometric product (S_(S) ₂ =(S _(S) S _(S))(S _(S) S _(S))^(†)) of a geometric product S _(S) S _(S)) of said shared secret multivector (S _(S)) and a Clifford conjugate (S _(S)) of said shared secret multivector (S _(S)) and a geometric reverse ((S _(S) S _(S))^(†)) of said geometric product (S _(S) S _(S)) of said shared secret multivector (S _(S)) and said Clifford conjugate (S _(S)) of said shared secret multivector (S _(S)).
 22. The method of claim 20 wherein said Geometric Algebra geometric product operations are comprised of at least one of a group chosen from: geometric product “sandwich” (C=S _(S) M S _(S) ₂ to encrypt and M=S _(S) ⁻¹ C S _(S) ₂ ⁻¹ to decrypt); and multivector based Sylvester's equation (C=S _(S) M+M S _(S) ₂ to encrypt and M=(S _(S) ₂ +S _(S) ₂ +S _(S) ⁻¹ S _(S) ₂ S _(S) ₂ +S _(S))⁻¹(S _(S) ⁻¹ C S _(S) ₂ +C) to decrypt).
 23. The method of claim I wherein numeric values of said numeric message data (M), coefficients of said message multivector (M), and coefficients of said shared secret multivector (S _(S)) are comprised of at least one of a group chosen from: positive numbers, negative numbers, zero, integer numbers, and real numbers.
 24. A method for encrypting numeric message data (M) on a source computing device in order to facilitate transfer of encrypted data from said source computing device to a destination computing device, the method comprising: distributing by said source computing device said numeric message data (M) into coefficients of a message multivector (M) in accord with a Message data coefficient distribution algorithm that is known to both said source computing device and said destination computing device; distributing by said source computing device a shared secret numeric value (S_(S)) into coefficients of a shared secret multivector (S _(S)) in accord with a shared secret coefficient distribution algorithm that is known to both said source computing device and said destination computing device, said shared secret numeric value (S_(S)) being known or knowable to both said source computing device and said destination computing device but is kept secret from other devices not intended to have access to said numeric message data; encrypting by said source computing device a cryptotext multivector (C) as a function of at least one Geometric Algebra geometric product operation on said message multivector (M) and said shared secret multivector (S _(S)); and sending by said source computing device said cryptotext multivector (C) to said destination computing device.
 25. A method for decrypting a cryptotext multivector (C) back into numeric message data (M) a destination computing device in order to facilitate transfer of encrypted data from a source computing device to said destination computing device, the method comprising: receiving by said destination computing device said cryptotext multivector (C) sent by said source computing device; distributing by said destination computing device said shared secret numeric value (S_(S)) into said shared secret multivector (S _(S)) in accord with said shared secret coefficient distribution algorithm; decrypting by said destination computing device said cryptotext multivector (C) as a function of at least one Geometric Algebra geometric product operation on said cryptotext multivector (C) and an inverse (S _(S) ⁻¹) of said shared secret multivector (S _(S)) back into said message multivector (M); and converting by said destination computing device said message multivector (M) into said message numeric data (M) in accord with reverse operation of said message data coefficient distribution algorithm.
 26. An Enhanced Data-Centric Encryption (EDGE) system for the encrypted transfer of numeric message data (M), the EDCE system comprising: a source computing device, wherein said source computing device further comprises: a source numeric message distribution subsystem that distributes said numeric message data (/1) into coefficients of a message multivector (M) in accord with a message data coefficient distribution algorithm that is known to both said source computing device and said destination computing device; a source numeric shared secret distribution subsystem that distributes a shared secret numeric value (S_(S)) into coefficients of a shared secret multivector (S _(S)) in accord with a shared secret coefficient distribution algorithm that is known to both said source computing device and said destination computing device, said shared secret numeric value (S_(S)) being known or knowable to both said source computing device and said destination computing device but is kept secret from other devices not intended to have access to said numeric message data; a source encryption subsystem that encrypts a cryptotext multivector (C) as a function of at least one Geometric Algebra geometric product operation on said message multivector (M) and said shared secret multivector (S _(S)); a source send subsystem that sends said cryptotext multivector (C) to said destination computing device; and a destination computing device, wherein said destination computing device further comprises: a destination receive subsystem that receives said cryptotext multivector (C) sent by said source computing device; a destination numeric shared secret distribution subsystem that distributes said shared secret numeric value (S_(S)) into said shared secret multivector (S _(S)) in accord with said shared secret coefficient distribution algorithm; a destination decrypt subsystem that decrypts said cryptotext multivector (C) as a function of at least one Geometric Algebra geometric product operation on said cryptotext multivector (C) and an inverse (S _(S) ⁻¹) of said shared secret multivector (S _(S)) back into said message multivector (M); and a destination convert multivector subsystem that converts said message multivector (M) into said message numeric data (M) in accord with reverse operation of said message data coefficient distribution algorithm.
 27. The EDCE system of claim 26 wherein evaluation of Geometric Algebra geometric products and inverses of multivectors is implemented on said source computing device and said destination computing device using basic arithmetic operations of addition, subtraction, multiplication, and division.
 28. The EDCE system of claim 27 wherein said implementation of said Geometric Algebra geometric products and inverses of multivectors on said source computing device and said destination computing device does not include a complex operation to select a prime number, to calculate a logarithm function, and/or to calculate a natural logarithm function.
 29. The EDCE system of claim 26: further comprising: wherein said source computing device further comprises a source alphanumeric text conversion subsystem that converts an original alphanumeric text message into said numeric message data (M) as a function of standard computer character encoding characteristics; and wherein said destination computing device further comprises a destination alphanumeric text conversion subsystem that converts said numeric message data (M) back into said original alphanumeric text message as a function of said standard computer character encoding characteristics.
 30. The EDGE system of claim 29 wherein said standard computer character encoding characteristics are ASCII (American Standard Code for Information Exchange) codes of text characters of said original alphanumeric text message.
 31. The EDGE system of claim 26 wherein said shared secret numeric value (S_(S)) between said source computing device and said destination computing device is established by a known shared secret technique.
 32. The EDGE system of claim 31 wherein said known shared secret technique is comprised of at least one of a group chosen from: pre-conditioning said source computing device and said destination computing device with said shared secret numeric value (S_(S)), standard public/private key exchange technique, RSA (Rivest-Shamir-Adleman) key exchange, and Diffie-Hellman key exchange.
 33. The EDGE system of claim 26 wherein said at least one Geometric Algebra geometric product operation is comprised of at least one of a group chosen from: a geometric product (C=M S _(S)) of said message multivector (M) and said shared secret multivector (S _(S)) to encrypt and a geometric product (M=C S _(S) ⁻¹) of said cryptotext multivector (C) and said inverse (S _(S) ⁻¹) of said shared secret multivector (S _(S)) to decrypt; geometric product “sandwich” (C=S _(S) M S _(S) to encrypt and M=S _(S) ⁻¹ C S _(S) ⁻¹ to decrypt); and multivector based Sylvester's equation (C=S _(S) M+M S _(S) to encrypt and M=(S _(S)+S _(S)+S _(S) ⁻¹ S _(S) S _(S)+S _(S))⁻¹(S _(S) ⁻¹ C S _(S)+C) to decrypt).
 34. The EDGE system of claim 26 wherein said message multivector (M) and said shared secret multivector (S _(S)) are at least two-dimension multivectors.
 35. The EDCE system of claim 34 wherein a dimension size (N) of said message multivector (M) and said shared secret multivector (S _(S)) is at least two-dimensions.
 36. The EDCE system of claim 35 wherein a number of coefficients for said message multivector (M) and said shared secret multivector (S _(S)) is increased by a factor of two (2^(N)) for each incremental increase in said dimension size (N).
 37. The EDCE system of claim 35 wherein an increase in said dimension size (N) of said message multivector (M) and said shared secret multivector (S _(S)) beyond two-dimension multivectors increases confusion and/or diffusion security characteristics of said encrypted transfer of said numeric message data from said source computing device to said destination computing device.
 38. The EDCE system of claim 35 wherein an increase in said dimension size (N) of said message multivector (M) and said shared secret multivector (S _(S)) beyond two-dimension multivectors increases an amount of data capable of being transferred in a single transfer transaction for said message multivector (M) such that additional coefficients in said message multivector (M) hold said increased amount of data capable of being transferred in a single transfer transaction.
 39. The EDGE system of claim 35 wherein said dimension size (N) of said message multivector (M) and said shared secret multivector (S _(S)) is greater than two-dimensions and further comprising including additional feature data in said message multivector (M) for each. data transfer such that additional coefficients in said message multivector (M) that is greater than two-dimensions hold said additional feature data.
 40. The EDCE system of claim 39 wherein said additional feature data is comprised of at least one of a group chosen from: dummy data to increase encryption security, command instructions for additional operations, and configuration data for said additional operations.
 41. The EDCE system of claim 26: wherein said source computing device further comprises: a source second shared secret key generation subsystem that generates a second shared secret key (S_(S) ₂ ) as a scalar result of a 0-Blade Reduction Operation of said shared secret multivector (S _(S)); and a source second numeric shared secret distribution subsystem that distributes said second shared secret key (S_(S) ₂ ) into coefficients of a second shared secret multivector (S _(S) ₂ ) in accord with a second shared secret coefficient distribution algorithm that is known to both said source computing device and said destination computing device; wherein said source encryption subsystem further encrypts said cryptotext multivector (C) as a function of Geometric Algebra geometric product operations on said message multivector (M), said shared secret multivector (S _(S)), and said second shared secret multivector (S _(S) ₂ ); wherein said destination computing device further comprises: a destination second shared secret key generation subsystem that generates said second shared secret key (S_(S) ₂ ) as a scalar result of said 0-Blade Reduction Operation of said shared secret multivector (S _(S)); and a destination second numeric shared secret distribution subsystem that distributes said second shared secret key (S_(S) ₂ ) into said second shared secret multivector (S _(S) ₂ ) in accord with said second shared secret coefficient distribution algorithm; and wherein said destination decryption subsystem further decrypts said cryptotext multivector (C) as a function of Geometric Algebra geometric product operations on said cryptotext multivector (C), an inverse (S _(S) ⁻¹) of said shared secret multivector (S _(S)), and an inverse (S _(S) ₂ ⁻¹) of said second shared secret multivector (S _(S) ₂ ) back into said message multivector (M).
 42. The EDGE: system of claim 41 wherein said 0-Blade Reduction Operation is a geometric product (S_(S) ₂ =(S _(S) S _(S))(S _(S) S _(S))^(†)) of a geometric product (S _(S) S _(S)) of said shared secret multivector (S _(S)) and a Clifford conjugate (S _(S)) of said shared secret multivector (S _(S)) and a geometric reverse ((S _(S) S _(S))^(†)) of said geometric product (S _(S) S _(S)) of said shared secret) multivector (S _(S)) and said Clifford conjugate (S _(S)) of said shared secret multivector (S _(S)).
 43. The EDCE system of claim 41 wherein said Geometric Algebra geometric product operations are comprised of at least one of a group chosen from: geometric product “sandwich” (C=S _(S) M S _(S) ₂ to encrypt and M=S _(S) ⁻¹ C S _(S) ₂ ⁻¹ to decrypt); and multivector based Sylvester's equation (C=S _(S) M+M S _(S) ₂ to encrypt and M=(S _(S) ₂ +S _(S) ₂ +S _(S) ⁻¹ S _(S) ₂ S _(S) ₂ +S _(S))⁻¹(S _(S) ⁻¹ C S _(S) ₂ +C) to decrypt).
 44. The EDCE system of claim 26: wherein said source send subsystem further comprises: a source cryptotext multivector to numeric data subsystem that converts said cryptotext multivector (C) into cryptotext numeric data (C) in accord with reverse operation of a cryptotext data coefficient distribution algorithm that is known to both said source computing device and said destination computing device; and a source send cryptotext numeric data subsystem that sends said cryptotext numeric data (C) to said destination computing device; and wherein said destination receive subsystem further comprises: a destination receive cryptotext numeric data subsystem that receives said cryptotext numeric data (C) sent by said source computing device; and a destination cryptotext numeric data to multivector subsystem that distributes said cryptotext numeric data (C) into said cryptotext multivector (C) in accord with said cryptotext data coefficient distribution algorithm.
 45. The EDCE system of claim 44: wherein said source computing device further comprises: a source second shared secret key generation subsystem that generates a second shared secret key (S_(S) ₂ ) as a scalar result of a 0-Blade Reduction Operation of said shared secret multivector (S _(S)); and a source second numeric shared secret distribution subsystem that distributes said second shared secret key (S_(S) ₂ ) into coefficients of a second shared secret multivector (S _(S) ₂ ) in accord with a second shared secret coefficient distribution algorithm that is known to both said source computing device and said destination computing device; wherein said source encryption subsystem further encrypts said cryptotext multivector (C) as a function of Geometric Algebra geometric product operations on said message multivector (M), said shared secret multivector (S _(S)), and said second shared secret multivector (S _(S) ₂ ); wherein said source cryptotext multivector to numeric data subsystem further converts said cryptotext multivector (C) into pre-cipher cryptotext numeric data (C′) in accord with reverse operation of said cryptotext data coefficient distribution algorithm that is known to both said source computing device and said destination computing device and masks said pre-cipher cryptotext numeric data (C′) by an exclusive or (C=C′XOR S_(S)) with said shared secret numeric value (S_(S)) to obtain said cryptotext numeric data (C); wherein said destination cryptotext numeric data to multivector subsystem further unmasks said cryptotext numeric data (C) by an exclusive or (C′=C XOR S_(S)) with said shared secret numeric value (S_(S)) to obtain said pre-cipher cryptotext numeric data (C′) and distributes said pre-cipher cryptotext numeric data (C′) into said cryptotext multivector (C) in accord with said cryptotext data coefficient distribution algorithm wherein said destination computing device further comprises: a destination second shared secret key generation subsystem that generates said second shared secret key (S_(S) ₂ ) as a scalar result of said 0-Blade Reduction Operation of said shared secret multivector (S _(S)); and a destination second numeric shared secret distribution subsystem that distributes said second shared secret key (S_(S) ₂ ) into said second shared secret multivector (S _(S) ₂ ) in accord with said second shared secret coefficient distribution algorithm and wherein said destination decryption subsystem further decrypts said cryptotext multivector (C) as a function of Geometric Algebra geometric product operations on said cryptotext multivector (C), an inverse (S _(S) ⁻¹) of said shared secret multivector (S _(S)), and an inverse (S _(S) ₂ ⁻¹) of said second shared secret multivector (S _(S) ₂ ) back into said message multivector (M).
 46. The EDCE system of claim 45 wherein said 0-Blade Reduction Operation is a geometric product (S_(S) ₂ =(S _(S) S _(S))(S _(S) S _(S))^(†)) of a geometric product (S _(S) S _(S)) of said shared secret multivector (S _(S)) and a Clifford conjugate 60 of said shared secret multivector (S _(S)) and a geometric reverse ((S _(S) S _(S))^(†)) of said geometric product (S _(S) S _(S)) of said shared secret multivector (S _(S)) and said Clifford conjugate (S _(S)) of said shared secret multivector (S _(S)).
 47. The EDCE system of claim 45 wherein said Geometric Algebra geometric product operations are comprised of at least one of a group chosen from: geometric product “sandwich” (C=S _(S) M S _(S) ₂ , to encrypt and M=S _(S) ⁻¹ C S _(S) ₂ ⁻¹ to decrypt); and multivector based Sylvester's equation (C=S _(S) M S _(S) ₂ to encrypt and M=(S _(S) ₂ +S _(S) ₂ +S _(S) ⁻¹ S _(S) ₂ S _(S) ₂ +S _(S))⁻¹(S _(S) ⁻¹ C S _(S) ₂ +C) to decrypt).
 48. The EDCE system of claim 26 wherein numeric values of said numeric message data (M), coefficients of said message multivector (M), and coefficients of said shared secret multivector (S _(S)) are comprised of at least one of a group chosen from: positive numbers, negative numbers, zero, integer numbers, and real numbers.
 49. An Enhanced Data-Centric Encryption (EDCE) source computing device for encrypting numeric message data (M) in order to facilitate transfer of encrypted data from said EDCE source computing device to a destination computing device, the EDCE source computing device comprising: a source numeric message distribution subsystem that distributes said numeric message data (M) into coefficients of a message multivector (M) in accord with a message data coefficient distribution algorithm that is known to both said EDCE source computing device and said destination computing device; a source numeric shared secret distribution subsystem that distributes a shared secret numeric value (S_(S)) into coefficients of a shared secret multivector (S _(S)) in accord with a shared secret coefficient distribution algorithm that is known to both said EDCE source computing device and said destination computing device, said shared secret numeric value (S_(S)) being known or knowable to both said EDCE source computing device and said destination computing device but is kept secret from other devices not intended to have access to said numeric message data; a source encryption subsystem that encrypts a cryptotext multivector (C) as a function, of at least one Geometric Algebra geometric product operation on said message multivector (M) and said shared secret multivector (S _(S)); and a source send subsystem that sends said cryptotext multivector (C) to said destination computing device.
 50. An Enhanced Data-Centric Encryption (EDCE) destination computing device for decrypting a cryptotext multivector (C) hack into numeric message data (M) in order to facilitate transfer of encrypted data from a source computing device to said EDCE destination computing device, the EDCE destination computing device comprising: a destination receive subsystem that receives said cryptotext multivector (C) sent by said source computing device; a destination numeric shared secret distribution subsystem that distributes said shared secret numeric value (S_(S)) into said shared secret multivector (S _(S)) in accord with said shared secret coefficient distribution algorithm; a destination decrypt subsystem that decrypts said cryptotext multivector (C) as a function of at least one Geometric Algebra geometric product operation on said cryptotext multivector (C) and an inverse (S _(S) ⁻¹) of said shared secret multivector (S _(S)) back into said message multivector (M); and a destination convert multivector subsystem that converts said message multivector (M) into said message numeric data (M) in accord with reverse operation of said message data coefficient distribution algorithm. 